IP Library › Granted Patent US 12,476,787
Granted Patent B2
US 12,476,787 · App. 18/295,959 · Granted Nov 18, 2025

Homomorphic encryption

Inventors: Henry Markram (Lausanne, CH); Felix Schuermann (Grens, CH); Kathryn Hess Bellwald (Aigle, CH); Fabien Delalondre (Geneva, CH)
Assignee: INAIT SA
H04L9/008G06F17/18G06F21/602G06N3/047
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,476,787
App. No.
18/295,959
Granted
Nov 18, 2025
Kind
B2
Abstract

Methods, systems, and devices for homomorphic encryption. In one implementation, the methods include inputting first data into a recurrent artificial neural network, identifying patterns of activity in the recurrent artificial neural network that are responsive to the input of the secure data, storing second data representing whether the identified patterns of activity comports with topological patterns, and statistically analyzing the second data to draw conclusions about the first data.

Claims (52)

1 . A method implemented in hardware, in software, or in a combination thereof, the method comprising

homomorphically encrypting secure data, comprising

determining whether signal transmission activity between nodes in a recurrent artificial neural network comports with pre-defined patterns of signal transmission activity between pre-defined groups of nodes, wherein the signal transmission activity is responsive to input of the secure data into the recurrent artificial neural network and signal transmission activity between a pre-defined group of nodes in the recurrent artificial neural network comports with a respective pattern of the pre-defined patterns of signal transmission activity when the signal transmission activity between the pre-defined group of nodes matches the respective pattern, and

storing binary data as a homomorphic encryption of the secure data, the binary data comprising a vector of digits comprising ones and zeros, wherein

each element of the vector corresponds to a respective pattern of the pre-defined patterns of signal transmission activity for a respective pre-defined group of nodes,

each non-zero element of the vector of digits in the binary data indicates that the signal transmission activity in the recurrent artificial neural network comports with the corresponding respective pattern of the pre-defined patterns of signal transmission activity for the respective pre-defined group of nodes in the recurrent artificial neural network; and

making the stored binary data available for statistical analysis that draws conclusions about the secure data.

2 . The method of claim 1 , wherein the patterns of signal transmission activity in the recurrent artificial neural network comprise directed simplex patterns of signal transmission activity in the network.

3 . The method of claim 2 , wherein the directed simplex patterns enclose cavities.

4 . The method of claim 1 , wherein determining whether the signal transmission activity comports with the pre-defined patterns comprises:

determining a timing of signal transmission activity having a complexity that is distinguishable from other signal transmission activity that is responsive to the input; and

determining whether the signal transmission activity comports with the pre-defined patterns based on the timing of the signal transmission activity that has the distinguishable complexity.

5 . The method of claim 1 , wherein the method further comprises:

receiving data characterizing tailoring of a characteristic of the input of the secure data into the network; and

tailoring the input of the secure data into the network in accordance with the data.

6 . The method claim 5 , wherein the data characterizes either:

synapses and nodes into which bits of the secure data are to be injected, or

an order in which bits of the secure data are to be injected.

7 . The method of claim 1 , wherein the method further comprises:

tailoring the response of the recurrent artificial neural network to the input of the secure data by changing one or more properties of a node or a link within the network.

8 . A method implemented in hardware, in software, or in a combination thereof, the method comprising

homomorphically encrypting first data, including:

inputting the first data into a recurrent artificial neural network,

identifying patterns of signal transmission activity between nodes within the recurrent artificial neural network, wherein the patterns of signal transmission activity are responsive to the input of the first data, and

storing second data as a homomorphic encryption of the first data, the second data representing whether the identified patterns of signal transmission activity comport with one or more pre-defined topological patterns of signal transmission activity, comprising storing the second data as a vector of ones and zeros, wherein each element of the vector corresponds to a respective pattern of the pre-defined topological patterns of signal transmission activity for a respective pre-defined group of nodes, each non-zero element in the vector indicating that the corresponding respective pre-defined topological patterns of signal transmission activity is active for the respective pre-defined group of nodes and each zero element in the vector indicating that the corresponding respective pre-defined topological pattern of signal transmission activity is inactive for the respective pre-defined group of nodes in the recurrent artificial neural network; and

making the stored second data available for statistical analysis that draws conclusions about the first data.

9 . The method of claim 8 , wherein the identified patterns of signal transmission activity in the recurrent artificial neural network comprise directed simplex patterns of signal transmission activity in the network.

10 . The method of claim 9 , wherein the directed simplex patterns enclose cavities.

11 . The method of claim 8 , wherein identifying the patterns of signal transmission activity comprises:

determining a timing of signal transmission activity having a complexity that is distinguishable from other signal transmission activity that is responsive to the input; and

identifying the patterns based on the timing of the signal transmission activity that has the distinguishable complexity.

12 . The method of claim 8 , wherein the method further comprises:

receiving data characterizing tailoring a characteristic of the input of the first data into the network; and

tailoring the input of the first data into the network in accordance with the data characterizing the tailoring of the characteristic.

13 . The method claim 12 , wherein the data characterizes either:

synapses and nodes into which bits of the first data are to be injected, or

an order in which bits of the first data are to be injected.

14 . The method of claim 8 , wherein the method further comprises:

tailoring the response of the network to the input of the first data by changing one or more properties of a node or a link within the network.

15 . A homomorphic encryption system comprising:

a recurrent artificial neural network comprising an input configured to receive secure first data, wherein the input includes an input layer or one or more injection sites into nodes or links in the recurrent artificial neural network;

data processing apparatus configured to identify patterns of signal transmission activity between three or more nodes within the recurrent artificial neural network, wherein the patterns of signal transmission activity are responsive to the input of the secure first data; and

a data storage device configured to store second data as a homomorphic encryption of the secure first data, the second data representing whether the identified patterns of activity comport with one or more pre-defined topological patterns of signal transmission activity, wherein the second data comprises a binary vector of digits, each non-zero digit indicating that a respective pre-defined topological pattern of signal transmission activity is active for a respective pre-defined group of nodes in the recurrent artificial neural network and each zero digit indicating that a respective pre-defined topological pattern of signal transmission activity is inactive for a respective pre-defined group of nodes in the recurrent artificial neural network.

16 . The homomorphic encryption system of claim 15 , wherein the patterns of signal transmission activity in the recurrent artificial neural network comprise directed simplex patterns of signal transmission activity in the network, wherein the directed simplex patterns enclose cavities.

17 . The homomorphic encryption system of claim 15 , wherein the data processing apparatus of the homomorphic encryption system is configured to:

determine a timing of signal transmission activity having a complexity that is distinguishable from other signal transmission activity that is responsive to the input; and

identify the patterns based on the timing of the signal transmission activity that has the distinguishable complexity.

18 . The homomorphic encryption system of claim 15 , wherein the homomorphic encryption system further comprises data processing apparatus configured to:

receive data characterizing tailoring a characteristic of the input of the secure data into the network; and

tailor the input of the secure data into the network in accordance with the data.

19 . The homomorphic system of claim 15 , wherein the data processing apparatus of the homomorphic encryption system is configured to:

tailor the response of the network to the input of the secure data by changing one or more properties of a node or a link within the network.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 6, 2023
From: MARKRAM, HENRY; SCHUERMANN, FELIX; DELALONDRE, FABIEN
To: INAIT SA
Reel/Frame 065471/0501 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 4, 2023
From: HESS BELLWALD, KATHRYN
To: INAIT SA
Reel/Frame 064496/0807 →
Continuity (2)
Continuation 16356391 · Mar 18, 2019
Related Publication 20230370244A1 · Nov 16, 2023
References Cited (400)
US 5822742A · Alkon et al. · 1998 [cited by applicant]
US 7321882B2 · Herbert · 2008 [cited by applicant]
US 7412426B2 · Hercus · 2008 [cited by applicant]
US 8818923B1 · Hoffmann · 2014 [cited by applicant]
US 9009089B1 · El Defrawy · 2015 [cited by examiner]
US 9189745B2 · Hawkins · 2015 [cited by examiner]
US 9336239B1 · Hoffmann et al. · 2016 [cited by applicant]
US 9558442B2 · Canoy et al. · 2017 [cited by applicant]
US 9785886B1 · Andoni et al. · 2017 [cited by applicant]
US 9875440B1 · Lamport · 2018 [cited by applicant]
US 10019506B1 · Li et al. · 2018 [cited by applicant]
US 10153806B1 · Petre et al. · 2018 [cited by applicant]
US 10417558B1 · Bauer et al. · 2019 [cited by applicant]
US 10510000B1 · Lamport · 2019 [cited by applicant]
US 10621364B1 · El Defrawy · 2020 [cited by examiner]
US 10628486B2 · Chu et al. · 2020 [cited by applicant]
US 10650047B2 · Yanagisawa · 2020 [cited by applicant]
US 10885020B1 · Ablitt · 2021 [cited by applicant]
US 10922510B2 · Tscherepanow · 2021 [cited by examiner]
US 11195038B2 · Nunn et al. · 2021 [cited by applicant]
US 11218498B2 · Hajimirsadeghi et al. · 2022 [cited by applicant]
US 11250326B1 · Ko et al. · 2022 [cited by applicant]
US 11264037B2 · Lesso · 2022 [cited by examiner]
US 11278413B1 · Lang · 2022 [cited by applicant]
US 11569978B2 · Hess et al. · 2023 [cited by applicant]
US 11580401B2 · Markram et al. · 2023 [cited by applicant]
US 11615285B2 · Reimann et al. · 2023 [cited by applicant]
US 11651210B2 · Henry et al. · 2023 [cited by applicant]
US 11652603B2 · Markram et al. · 2023 [cited by applicant]
US 11663478B2 · Markram et al. · 2023 [cited by applicant]
US 11797827B2 · Markram et al. · 2023 [cited by applicant]
US 11816553B2 · Markram et al. · 2023 [cited by applicant]
US 11893471B2 · Markram et al. · 2024 [cited by applicant]
US 11972343B2 · Markram et al. · 2024 [cited by applicant]
US 12020157B2 · Markram et al. · 2024 [cited by applicant]
US 12113891B2 · Markram et al. · 2024 [cited by applicant]
US 12147904B2 · Markram et al. · 2024 [cited by applicant]
US 12154023B2 · Markram et al. · 2024 [cited by applicant]
US 20030140020A1 · Chen et al. · 2003 [cited by applicant]
US 20040015459A1 · Herbert · 2004 [cited by applicant]
US 20040052367A1 · Yang et al. · 2004 [cited by applicant]
US 20060112028A1 · Xiao et al. · 2006 [cited by applicant]
US 20060184471A1 · Minamino et al. · 2006 [cited by applicant]
US 20080152217A1 · Greer · 2008 [cited by applicant]
US 20080267188A1 · Furber et al. · 2008 [cited by applicant]
US 20090006060A1 · Rhodes · 2009 [cited by applicant]
US 20090012581A1 · Rhodes · 2009 [cited by examiner]
US 20090187736A1 · Raichelgauz et al. · 2009 [cited by applicant]
US 20140156901A1 · Raichelgauz et al. · 2014 [cited by applicant]
US 20150058352A1 · Brand · 2015 [cited by applicant]
US 20150206049A1 · Canoy et al. · 2015 [cited by applicant]
US 20150280906A1 · Shany et al. · 2015 [cited by applicant]
US 20150310303A1 · Andreopoulos et al. · 2015 [cited by applicant]
US 20150347870A1 · Andreopoulos et al. · 2015 [cited by applicant]
US 20150363689A1 · Henry et al. · 2015 [cited by applicant]
US 20150371132A1 · Gemello et al. · 2015 [cited by applicant]
US 20160048756A1 · Hall et al. · 2016 [cited by applicant]
US 20160204936A1 · Sakemi · 2016 [cited by examiner]
US 20160350648A1 · Gilad-Bachrach et al. · 2016 [cited by applicant]
US 20170024661A1 · Hunsberger et al. · 2017 [cited by applicant]
US 20170124452A1 · Tucker et al. · 2017 [cited by applicant]
US 20170139759A1 · Bandara · 2017 [cited by examiner]
US 20170213131A1 · Hammond et al. · 2017 [cited by applicant]
US 20170229117A1 · van der Made et al. · 2017 [cited by applicant]
US 20170249536A1 · Hillar et al. · 2017 [cited by applicant]
US 20180005111A1 · Chaudhari et al. · 2018 [cited by applicant]
US 20180018553A1 · Bach et al. · 2018 [cited by applicant]
US 20180053108A1 · Olabiyi et al. · 2018 [cited by applicant]
US 20180053114A1 · Adjaoute · 2018 [cited by applicant]
US 20180082171A1 · Merity et al. · 2018 [cited by applicant]
US 20180096248A1 · Chabanne · 2018 [cited by examiner]
US 20180107922A1 · Paul et al. · 2018 [cited by applicant]
US 20180136912A1 · Venkataramani et al. · 2018 [cited by applicant]
US 20180157973A1 · El-Yaniv et al. · 2018 [cited by applicant]
US 20180165547A1 · Haung et al. · 2018 [cited by applicant]
US 20180197069A1 · Reimann · 2018 [cited by examiner]
US 20180197076A1 · Paik et al. · 2018 [cited by applicant]
US 20180233130A1 · Kaskari et al. · 2018 [cited by applicant]
US 20180247198A1 · Vasudevan et al. · 2018 [cited by applicant]
US 20180336453A1 · Merity et al. · 2018 [cited by applicant]
US 20180373985A1 · Yang et al. · 2018 [cited by applicant]
US 20190012574A1 · Anthony et al. · 2019 [cited by applicant]
US 20190036678A1 · Ahmed · 2019 [cited by applicant]
US 20190042988A1 · Brown et al. · 2019 [cited by applicant]
US 20190044916A1 · Jones · 2019 [cited by examiner]
US 20190050726A1 · Azaria et al. · 2019 [cited by applicant]
US 20190122096A1 · Husain · 2019 [cited by applicant]
US 20190122140A1 · Sen · 2019 [cited by examiner]
US 20190171187A1 · Cella et al. · 2019 [cited by applicant]
US 20190171929A1 · Abadi · 2019 [cited by examiner]
US 20190180187A1 · Rawal et al. · 2019 [cited by applicant]
US 20190197410A1 · Berry, II · 2019 [cited by applicant]
US 20190228300A1 · Cao et al. · 2019 [cited by applicant]
US 20190244348A1 · Buckler et al. · 2019 [cited by applicant]
US 20190265950A1 · Heeger et al. · 2019 [cited by applicant]
US 20190266246A1 · Wang et al. · 2019 [cited by applicant]
US 20190286074A1 · Hoffman · 2019 [cited by applicant]
US 20190304568A1 · Wei et al. · 2019 [cited by applicant]
US 20190312898A1 · Verma · 2019 [cited by examiner]
US 20190335192A1 · Otto et al. · 2019 [cited by applicant]
US 20190354846A1 · Mellempudi et al. · 2019 [cited by applicant]
US 20190370647A1 · Doshi et al. · 2019 [cited by applicant]
US 20190377976A1 · Markram et al. · 2019 [cited by applicant]
US 20190377999A1 · Markram · 2019 [cited by examiner]
US 20190378000A1 · Markram · 2019 [cited by examiner]
US 20190378007A1 · Markram · 2019 [cited by examiner]
US 20190378008A1 · Markram et al. · 2019 [cited by applicant]
US 20190392303A1 · Cherubini et al. · 2019 [cited by applicant]
US 20200011668A1 · Derhy et al. · 2020 [cited by applicant]
US 20200012927A1 · Raichelgauz et al. · 2020 [cited by applicant]
US 20200098135A1 · Ganjineh et al. · 2020 [cited by applicant]
US 20200117690A1 · Tran · 2020 [cited by examiner]
US 20200126126A1 · Briancon et al. · 2020 [cited by applicant]
US 20200134016A1 · Cao et al. · 2020 [cited by applicant]
US 20200184055A1 · Storm et al. · 2020 [cited by applicant]
US 20200210764A1 · Hamedi et al. · 2020 [cited by applicant]
US 20200228336A1 · Streit · 2020 [cited by examiner]
US 20200242444A1 · Zhang et al. · 2020 [cited by applicant]
US 20200285944A1 · Lee et al. · 2020 [cited by applicant]
US 20200302297A1 · Jaganathan et al. · 2020 [cited by applicant]
US 20200304284A1 · Markram · 2020 [cited by examiner]
US 20200304285A1 · Hess · 2020 [cited by examiner]
US 20200310400A1 · Jha et al. · 2020 [cited by applicant]
US 20200367810A1 · Shouldice et al. · 2020 [cited by applicant]
US 20200380335A1 · Neznal · 2020 [cited by applicant]
US 20200402497A1 · Semonov et al. · 2020 [cited by applicant]
US 20210027163A1 · Baker · 2021 [cited by examiner]
US 20210049441A1 · Bronstein · 2021 [cited by applicant]
US 20210049446A1 · Gurumurthi et al. · 2021 [cited by applicant]
US 20210058547A1 · Puttamalla et al. · 2021 [cited by applicant]
US 20210097578A1 · Holmes et al. · 2021 [cited by applicant]
US 20210110115A1 · Hermann et al. · 2021 [cited by applicant]
US 20210182604A1 · Anthony et al. · 2021 [cited by applicant]
US 20210182653A1 · Markram et al. · 2021 [cited by applicant]
US 20210182654A1 · Markram et al. · 2021 [cited by applicant]
US 20210182655A1 · Markram et al. · 2021 [cited by applicant]
US 20210182657A1 · Markram et al. · 2021 [cited by applicant]
US 20210182681A1 · Markram et al. · 2021 [cited by applicant]
US 20210271319A1 · Lussier et al. · 2021 [cited by applicant]
US 20210319098A1 · Pogorelik et al. · 2021 [cited by applicant]
US 20210338007A1 · Choi et al. · 2021 [cited by applicant]
US 20210398621A1 · Stojevic et al. · 2021 [cited by applicant]
US 20220005332A1 · Metzler et al. · 2022 [cited by applicant]
US 20220012877A1 · Buckler et al. · 2022 [cited by applicant]
US 20220147760A1 · Dutta et al. · 2022 [cited by applicant]
US 20220148454A1 · Jaramaz et al. · 2022 [cited by applicant]
US 20220157436A1 · Harley et al. · 2022 [cited by applicant]
US 20220187847A1 · Cella et al. · 2022 [cited by applicant]
US 20220197306A1 · Cella et al. · 2022 [cited by applicant]
US 20220261593A1 · Yu et al. · 2022 [cited by applicant]
US 20220269346A1 · Hussami et al. · 2022 [cited by applicant]
US 20230019839A1 · Markram · 2023 [cited by applicant]
US 20230024925A1 · Markram et al. · 2023 [cited by applicant]
US 20230028511A1 · Markram et al. · 2023 [cited by applicant]
US 20230085384A1 · Lütgehetmann et al. · 2023 [cited by applicant]
US 20230171086A1 · Hess et al. · 2023 [cited by applicant]
US 20230297808A1 · Reimann et al. · 2023 [cited by applicant]
US 20230316077A1 · Henry et al. · 2023 [cited by applicant]
US 20230351196A1 · Markram et al. · 2023 [cited by applicant]
US 20240046077A1 · Markram et al. · 2024 [cited by applicant]
US 20240111994A1 · Markram et al. · 2024 [cited by applicant]
US 20240176985A1 · Markram et al. · 2024 [cited by applicant]
US 20240362480A1 · Markram et al. · 2024 [cited by applicant]
US 20240386265A1 · Markram et al. · 2024 [cited by applicant]
US 20250070956A1 · Hess Bellwald et al. · 2025 [cited by applicant]
US 20250117628A1 · Markram et al. · 2025 [cited by applicant]
CN 101669130 · 2010 [cited by applicant]
CN 101719908A · 2010 [cited by applicant]
CN 102859538 · 2013 [cited by applicant]
CN 103988203 · 2014 [cited by applicant]
CN 104318304 · 2015 [cited by applicant]
CN 104335219 · 2015 [cited by applicant]
CN 105095966 · 2015 [cited by applicant]
CN 105787561A · 2016 [cited by applicant]
CN 106156845 · 2016 [cited by applicant]
CN 107247989 · 2017 [cited by applicant]
CN 107423814 · 2017 [cited by applicant]
CN 107743630A · 2018 [cited by applicant]
CN 107844830 · 2018 [cited by applicant]
CN 108348750 · 2018 [cited by applicant]
CN 108777622A · 2018 [cited by applicant]
CN 112567387 · 2021 [cited by applicant]
CN 112567388 · 2021 [cited by applicant]
CN 112567389 · 2021 [cited by applicant]
CN 112567390 · 2021 [cited by applicant]
CN 112585621 · 2021 [cited by applicant]
EP 1283496 · 2003 [cited by applicant]
EP 3340121 · 2018 [cited by applicant]
EP 3803699 · 2021 [cited by applicant]
EP 3803705 · 2021 [cited by applicant]
EP 3803706 · 2021 [cited by applicant]
EP 3803707 · 2021 [cited by applicant]
EP 3803708 · 2021 [cited by applicant]
KR 20210008417 · 2021 [cited by applicant]
KR 20210008418 · 2021 [cited by applicant]
KR 20210008419 · 2021 [cited by applicant]
KR 20210008858 · 2021 [cited by applicant]
KR 20210010894 · 2021 [cited by applicant]
TW 201437945 · 2014 [cited by applicant]
TW 201535277 · 2015 [cited by applicant]
TW 201725519 · 2017 [cited by applicant]
TW I608429 · 2017 [cited by applicant]
TW 201928789 · 2019 [cited by applicant]
TW 201935326 · 2019 [cited by applicant]
TW 201937392 · 2019 [cited by applicant]
WO WO2007137047 · 2007 [cited by applicant]
WO WO2016206765 · 2016 [cited by applicant]
WO WO2017083399 · 2017 [cited by applicant]
WO WO2017197375 · 2017 [cited by applicant]
WO WO2017200971 · 2017 [cited by applicant]
WO WO2018058426 · 2018 [cited by applicant]
WO WO2018175400 · 2018 [cited by applicant]
WO WO2019238483 · 2019 [cited by applicant]
WO WO2019238512 · 2019 [cited by applicant]
WO WO2019238513 · 2019 [cited by applicant]
WO WO2019238522 · 2019 [cited by applicant]
WO WO2019238523 · 2019 [cited by applicant]
WO WO2020187676 · 2020 [cited by applicant]
WO WO2020187694 · 2020 [cited by applicant]
WO WO2021116071 · 2021 [cited by applicant]
WO WO2021116075 · 2021 [cited by applicant]
WO WO2021116140 · 2021 [cited by applicant]
WO WO2021116147 · 2021 [cited by applicant]
WO WO2021116250 · 2021 [cited by applicant]
WO WO2021116379 · 2021 [cited by applicant]
WO WO2021116402 · 2021 [cited by applicant]
WO WO2021116404 · 2021 [cited by applicant]
WO WO2021116407 · 2021 [cited by applicant]
Office Action in U.S. Appl. No. 16/004,796, dated Jun. 29, 2023, 31 pages. [cited by applicant]
U.S. Appl. No. 16/004,635, filed Jun. 11, 2018, Markram. [cited by applicant]
U.S. Appl. No. 16/004,837, filed Jun. 11, 2018, Markram. [cited by applicant]
U.S. Appl. No. 16/004,796, filed Jun. 11, 2018, Markram. [cited by applicant]
U.S. Appl. No. 16/004,757, filed Jun. 11, 2018, Markram. [cited by applicant]
U.S. Appl. No. 16/004,671, filed Jun. 11, 2018, Markram. [cited by applicant]
U.S. Appl. No. 16/356,391, filed Mar. 18, 2019, Markram. [cited by applicant]
U.S. Appl. No. 16/356,478, filed Mar. 18, 2019, Hess. [cited by applicant]
U.S. Appl. No. 18/161,414, filed Jan. 30, 2023, Hess. [cited by applicant]
U.S. Appl. No. 16/710,266, filed Dec. 11, 2019, Markram. [cited by applicant]
U.S. Appl. No. 16/710,058, filed Dec. 11, 2019, Markram. [cited by applicant]
U.S. Appl. No. 16/710,205, filed Dec. 11, 2019, Markram. [cited by applicant]
U.S. Appl. No. 16/710,176, filed Dec. 11, 2019, Markram. [cited by applicant]
U.S. Appl. No. 18/167,958, filed Feb. 13, 2023, Markram. [cited by applicant]
U.S. Appl. No. 16/710,080, filed Dec. 11, 2019, Markram. [cited by applicant]
U.S. Appl. No. 18/295,969, filed Apr. 5, 2023, Henry. [cited by applicant]
U.S. Appl. No. 17/783,976, filed Jun. 9, 2022, Markram. [cited by applicant]
U.S. Appl. No. 17/783,978, filed Jun. 9, 2022, Markram. [cited by applicant]
U.S. Appl. No. 17/783,981, filed Jun. 9, 2022, Markram. [cited by applicant]
U.S. Appl. No. 17/454,347, filed Nov. 10, 2021, Lütgehetmann. [cited by applicant]
U.S. Appl. No. 15/864,146, filed Jan. 8, 2018, Reimann. [cited by applicant]
U.S. Appl. No. 18/188,888, filed Mar. 23, 2023, Reimann. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2022/073852, mailed on Mar. 28, 2024, 12 pages. [cited by applicant]
Mur-Artal et al., “ORB-SLAM: a Versatile and Accurate Monocular SLAM System,” IEEE transactions on robotics, Oct. 5, 2015, 31(5):1147-63. [cited by applicant]
Mur-Artal et al., “ORB-SLAM2: An Open-Source SLAM system for Monocular, Stereo, and RGB-D Cameras,” CoRR, Submitted on Jun. 19, 2017, arXiv:1610.06475, 9 pages. [cited by applicant]
Office Action in Chinese Appln. No. 201980053140.6, mailed on Apr. 29, 2024, 15 pages (with English translation). [cited by applicant]
Office Action in Chinese Appln. No. 201980053141.0, mailed on Apr. 30, 2024, 19 pages (with English translation). [cited by applicant]
Office Action in Chinese Appln. No. 201980053463.5, mailed on May 23, 2024, 7 pages (with English translation). [cited by applicant]
Office Action in Chinese Appln. No. 201980053465.4, mailed on May 23, 2024, 7 pages (with English translation). [cited by applicant]
Office Action in Chinese Appln. No. 201980054063.6, mailed on May 23, 2024, 7 pages (with English translation). [cited by applicant]
Office Action in U.S. Appl. No. 16/004,796, mailed on May 10, 2024, 40 pages. [cited by applicant]
U.S. Appl. No. 18/527,555, filed Dec. 4, 2023, Markram. [cited by applicant]
U.S. Appl. No. 18/611,781, filed Mar. 21, 2024, Markram. [cited by applicant]
U.S. Appl. No. 18/490,927, filed Oct. 20, 2023, Markram et al. [cited by applicant]
U.S. Appl. No. 18/487,566, filed Oct. 16, 2023, Markram et al. [cited by applicant]
U.S. Appl. No. 18/656,669, filed May 7, 2024, Markram. [cited by applicant]
U.S. Appl. No. 17/754,347, filed Nov. 10, 2021, Lütgehetmann. [cited by applicant]
U.S. Appl. No. 15/864,146, filed Jan. 8, 2023, Reimann. [cited by applicant]
Abbas et al., “Artificial Intelligence Conquering the next frontier of the digital world,” Research Gate, Dec. 17, 2017, 15 pages. [cited by applicant]
Achard et al., “A Resilient, Low-Frequency, Small-World Human Brain Functional Network with Highly Connected Association Cortical Hubs,” Journal of Neuroscience, Jan. 4, 2006, 26(1):63-72. [cited by applicant]
Aharoni et al. “Eigenvalues and homology of flag complexes and vector representations of graphs,” Geom. Funct. Anal., Jul. 28, 2005, 15:555-566. [cited by applicant]
Alaniz, “Machiavellian Playbook for Artificial General Intelligence (AGI), Early Doctrine for AGI power,” Research Gate, Aug. 2018, pp. 1-42. [cited by applicant]
Alaniz, “Remaking Einstein with a Dynamical Graph Rich Person Object Avatar Extraction Markup Language (intelligence as topological algebraic invariants, graph entropies, and dynamics),” Mar. 16, 2019, 14 pages. [cited by applicant]
Allswede et al., “Prenatal inflammation and risk for schizophrenia: A role for immune proteins in neurodevelopment,” Development and Psychopathology, Aug. 2, 2018, 30: 1157-1178. [cited by applicant]
Andersen et al., “Overlapping clusters for distributed computation,” In Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, Feb. 8, 2012, 9 pages. [cited by applicant]
Angeli, “Symmetric functions for fast image retrieval with persistent homology,” Math Meth Appl Sci., Apr. 24, 2018, 41:9567-9577. [cited by applicant]
Antonopoulos et al., “Evaluating performance of neural codes in neural communication networks,” Neural Networks, Sep. 24, 2018, pp. 1-17. [cited by applicant]
Arai et al., “The Effects of Theta Precession on Spatial Learning and Simplicial Complex Dynamics in a Topological Model of the Hippocampal Spatial Map,” PLOS Computational Biology, Jun. 19, 2014, 10(6):r1003651, 14 pag… [cited by applicant]
Astrivis [online], “Demo Scan Church Dec. 2016,” Dec. 2, 2016, retrieved on Nov. 27, 2022, retrieved from URL <https://www.youtube.com/watch?v=xCgQ4aaBlGo>, 2 pages [Video Submission]. [cited by applicant]
Bahraini et al., “Topological pattern selection in recurrent networks,” Neural Networks, Feb. 9, 2012, 31:22-32. [cited by applicant]
Baker et al., “Designing neural network architectures using reinforcement learning,” arXiv preprint, arXiv:1611.02167, Nov. 7, 2016, 18 pages. [cited by applicant]
Bale et al., “Efficient population coding of naturalistic whisker motion in the ventro-posterior medial thalamus based on precise spike timing,” Front. Neural Circuits, Sep. 25, 2015, 9: 1-14. [cited by applicant]
Baptiste-Bardin et al., “Topological exploration of artificial neuronal network dynamics,” Network Neuroscience, Jan. 24, 2019, pp. 1-28. [cited by applicant]
Baskararaja et al., “Subgraph matching using graph neural network,” Journal of Intelligent Learning Systems and Applications, Nov. 28, 2012, 4(04):274-278. [cited by applicant]
Basset et al., “Network models in neuroscience,” arXiv, Jul. 21, 2018, pp. 1-12. [cited by applicant]
Basset et al., “On the nature and use of models in network neuroscience,” Nature Reviews, Jul. 12, 2018, 19:566-578. [cited by applicant]
Bassett et al., “Dynamic reconfiguration of human brain networks during learning,” PNAS, Apr. 18, 2011, 108(18):7641-7646. [cited by applicant]
Bassett et al., “Network Neuroscience,” Network Neuroscience, Nat. Neurosci., Mar. 20, 2017, 20:353-364. [cited by applicant]
Baudot et al., “Topological Information Data Analysis,” Entropy, Sep. 2019, 21:1-38. [cited by applicant]
Bauer et al., “Clear and Compress: Computing Persistent Homology in Chunks,” [cited by applicant]
Bauer et al., “PHAT—Persistent Homology Algorithms Toolbox,” J. Symb. Comput., Jan. 1, 2017, 78: 76-90. [cited by applicant]
Bauer et al., “Real-time ultra-low power ECG anomaly detection using an event-driven neuromorphic processor,” IEEE transactions on biomedical circuits and systems, Nov. 11, 2019, 13(6):1575-82. [cited by applicant]
Bergomi et al., “Topological Graph persistence,” Mathematics, Jul. 20, 2017, pp. 1-15. [cited by applicant]
Betzel, “Stability of spontaneous, correlated activity in mouse auditory cortex,” PLOS: Computational Biology, Dec. 9, 2019, 1-25. [cited by applicant]
Bianconi et al., “Topological percolation on hyperbolic simplicial complexes,” Phys. Rev. E, Nov. 21, 2018, 5:1-18. [cited by applicant]
Bienenstock et al., “A model of neocortex,” Network Comput. Neural Syst., Jul. 27, 1994, 6:179-224. [cited by applicant]
Blanco et al., “A genetic algorithm to obtain the optimal recurrent neural network,” International Journal of Approximate Reasoning, Jan. 2000, 23(1):67-83. [cited by applicant]
Brody et al., “Correlations without synchrony,” Neural Comput. 11, Oct. 1, 1999, 11:1537-1551. [cited by applicant]
Brown et al., “Structure of the Afferent Terminals in Terminal Ganglion of a Cricket and Persistent Homology,” PLOS One, May 23, 2012, 7(5):e37278. [cited by applicant]
Bullmore et al., “Complex brain networks: graph theoretical analysis of structural and functional systems,” Nat. Rev. Neurosci., Mar. 10, 2009, 10:186-198. [cited by applicant]
Busch et al., “Intrinsic temporal tuning of neurons in the optic tectum is shaped by multisensory experience,” Journal of Neurophysiology, Sep. 5, 2019, pp. 1-23. [cited by applicant]
Cai et al., “Path-level network transformation for efficient architecture search,” In International Conference on Machine Learning, Jul. 3, 2018 PMLR, 10 pages. [cited by applicant]
Chacholski et al., “On the topology of complexes of injective words,” Journal of Applied and Computational Topology, Aug. 16, 2019, 21:1-16. [cited by applicant]
Chambers et al., “Higher-order synaptic interactions coordinate dynamics in recurrent networks,” PLoS computational biology, Aug. 19, 2016, 12(8):e1005078, 23 pages. [cited by applicant]
Chella et al., “Representational Issues in the Debate on the Standard Model of the Mind,” Association for the Advancement of Artificial Intelligence, Nov. 12, 2017, pp. 1-6. [cited by applicant]
Chen et al., “Neural Representation of Spatial Topology in the Rodent Hippocampus,” Neural Computation, Jan. 2014, 26(1):1-39. [cited by applicant]
Chklovskii et al., “Cortical rewiring and information storage,” Nature, Oct. 14, 2004, 431:782-788. [cited by applicant]
Choi et al., “A Survey of Binary Similarity and distance measures,” Systemic, Cybernetics, and Informatics, Jan. 8, 2010, 8:43-48. [cited by applicant]
Choi et al., “Abnormal metabolic connectivity in the pilocarpine-induced epilepsy rat model: A multiscale network analysis based on persistent homology,” NeuroImage, Oct. 1, 2014, 99:226-236. [cited by applicant]
Choudhary, “Approximation algorithms for Vietoris-Rips and Čech filtrations,” Doctoral Thesis of Computer Science, Faculty of Mathematics and Computer Science, Heidelberg University, Dec. 14, 2017, 140 pages. [cited by applicant]
Chowdhury et al., “Path homologies of deep feedforward networks,” Arxiv, Oct. 16, 2019, pp. 1-6. [cited by applicant]
Chung et al., “Persistence Diagrams of Cortical Surface Data,” Information Processing in Medical Imaging, 2009, pp. 386-397. [cited by applicant]
Coggan et al., “A Process for Digitizing and Simulating Biologically Realistic Oligocellular Networks Demonstrated for the Neuro-Glio-Vascular Ensemble,” Neurosci, Sep. 25, 2018, 12:1-21. [cited by applicant]
Collins, “The case for emulating insect brains using anatomical “wiring diagrams” equipped with biophysical models of neuronal activity,” Biological cybernetics, Dec. 1, 2019, 113: 465-75. [cited by applicant]
Cormen et al., “Introduction to Algorithms,” Copyright 2001 by The Massachusetts Institute of Technology, 984 pages. [cited by applicant]
Courtney et al., “Dense Power-law Networks and Simplicial Complexes,” ArXiv, Apr. 23, 2018, pp. 1-16. [cited by applicant]
Crawford et al., “A theory on the role of π-electrons of docosahexaenoic acid in brain function: The six methylene-interrupted double bonds and the precision of neural signaling,” Oilseeds & fats Crops and Lipids, May 2… [cited by applicant]
Crossley et al., “Cognitive relevance of the community structure of the human brain functional coactivation network,” PNAS, Jun. 24, 2013, 110(28):11583-11588. [cited by applicant]
Curto et al., “Cell groups reveal structure of stimulus space,” Plos Comput. Biol., Oct. 2008, 4(10):e100205. [cited by applicant]
Curto, “Relating network connectivity to dynamics: opportunities and challenges for theoretical neuroscience,” Current Opinion in Neurobiology, Oct. 1, 2019, 58:11-20. [cited by applicant]
Curto, “What Can Topology Tell US About the Neural Code?,” The American Mathematical Society, Jan. 2017, 54(1):63-78. [cited by applicant]
Dabaghian et al., “A topological paradigm for hippocampal spatial map formation using persistent homology,” Plos Comput. Biol., Aug. 2012, 8(8):e1002581. [cited by applicant]
Dabaghian et al., “Reconceiving the hippocampal map as a topological template,” Elife, Aug. 20, 2014, 3:e03476. [cited by applicant]
Davydov et al., “Neural Network Structures: Current and Future States,” Research Gate, Feb. 2, 2018, pp. 1-6. [cited by applicant]
DeCharms et al., “Primary cortical representation of sounds by the coordination of action-potential timing,” Nature, Jun. 13, 1996, 381(6583):610-613. [cited by applicant]
Djurfeldt et al., “Efficient generation of connectivity in neuronal networks from simulator-independent descriptions,” Frontiers in Neuroinformatics, Mar. 28, 2014, 8(43):1-11. [cited by applicant]
Dlotko [online], “Directed clique topology,” (slides are titled “Directed Complexes”), presented at BIRS workshop, video from 17w5043: Topological Methods in Brain Network Analysis, May 11, 2017, retrieved from < http:/… [cited by applicant]
Dlotko et al, “Topological analysis of the connectome of digital reconstructions of neural microcircuits,” ArXiv, a working paper, Jan. 7, 2016, 1-28 pages. [cited by applicant]
Doborjeh et al., “Spiking Neural Network Modelling Approach Reveals How Mindfulness Training Rewires the Brain,” Scientific Reports, Apr. 23, 2019, 9:1-15. [cited by applicant]
Docs.opencv.org [online], “Camera Calibration and 3D Reconstruction,” retrieved on Oct. 5, 2022, retrieved from URL <https://docs.opencv.org/4.4.0/d9/doc/group_calib3d.html#ga549c2075fac14829ff4a58bc931c033d)>, 78 pages. [cited by applicant]
Docs.opencv.org [online], “Pose Estimation,” available no later than Sep. 13, 2021, retrieved on Oct. 5, 2022, retrieved from URL <https://docs.opencv.org/4.x/d7/d53/tutorial_py_pose.html>, 3 pages. [cited by applicant]
Dongjiang et al., “DXSLAM: A Robust and Efficient Visual SLAM System with Deep Features,” ArXiv, Aug. 12, 2020, 8 pages. [cited by applicant]
Drakesmith et al., “Overcoming the effects of false positives and threshold bias in graph theoretical analyses of neuroimaging data,” NeuroImage, Sep. 2015, 118:313-333. [cited by applicant]
Ebli, “A Notion of Harmonic Clustering in Simplicial Complexes,” Laboratory for Topology and Neuroscience, École Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland, Oct. 17, 2019, 9 pages. [cited by applicant]
Ellis et al., “Describing High-Order Statistical Dependence Using “Concurrence Topology,” With Application to Functional MRI Brain Data,” Homology, Homotopy and Applications, 2014, 16(1):245-264. [cited by applicant]
Engel et al., “Temporal binding and the neural correlates of sensory awareness,” Trends Cogn. Sci., Jan. 1, 2001, 5: 16-25. [cited by applicant]
Erdos and Renyi, “On random graphs, I,” Math. Debrecen., 1959, 6:290-297. [cited by applicant]
Erdős et al., “On the evolution of random graphs,” Publ. Math. Inst. Hung. Acad. Sci., Jan. 1960, 17-60. [cited by applicant]
Extended European Search Report in European Appln. No. 17174314.9, dated Dec. 14, 2017, 11 pages. [cited by applicant]
Extended European Search Report in European Appln. No. 17174316.4, dated Dec. 14, 2017, 12 pages. [cited by applicant]
Extended European Search Report in European Appln. No. 17174317.2, dated Dec. 14, 2017, 12 pages. [cited by applicant]
Fan et al., “A Brief History of Simulation Neuroscience,” Front. Neuroinform., May 7, 2019, 13:1-28. [cited by applicant]
Feldbrugge et al., “Stochastic homology of Gaussian vs. non-Gaussian random fields: graphs towards Betti numbers and persistence diagrams,” Journal of Cosmology and Astroparticle Physics, Sep. 24, 2019, 49 pages. [cited by applicant]
Feng et al., “Persistent Homology of Geospatial Data: A Case Study with Voting,” Jan. 30, 2019, pp. 1-29. [cited by applicant]
Garcia et al., “Reconfigurations within resonating communities of brain regions following TMS reveal different scales of processing,” BioRxiv, Jan. 9, 2020, pp. 1-39. [cited by applicant]
Garcia et al., “Unsupervised classification of neural spikes with a hybrid multilayer artificial neural network,” Journal of Neuroscience Methods, 1998, 82:59-73. [cited by applicant]
Garrison et al., “The (in)stability of functional brain network measures across thresholds,” NeuroImage, Sep. 2015, 118:651-661. [cited by applicant]
Ghosh et al., “Design and Construction of a Brain-like computer: A New class of Frequency-Fractal Computing Using Wireless Communication in a Supramolecular Organic, Inorganic System,” Information, May 2014, 28-100. [cited by applicant]
Ginestet et al., “Brain Network Analysis: Separating Cost from Topology Using Cost-Integration,” PLOS One, Jul. 28, 2018, 2011, 6(7):e21570. [cited by applicant]
Github.com [online] “pytorch-tutorial/tutorials/03-advanced/image_captioning/,” Oct. 2007, retrieved on Jan. 21, 2020, retrieved from UR: <https://github.com/yunjey/pytorch-tutorial/tree/master/tutorials/03-advanced/ima… [cited by applicant]
Github.com [online], “facebookresearch/detectron2,” 2019, retrieved on Oct. 5, 2022, retrieved from URL <https://github.com/facebookresearch/detectron2>, 4 pages. [cited by applicant]
Giusti et al., “Clique topology reveals intrinsic geometric structure in neural correlations,” Proc. Natl. Acad. Sci. U.S.A., Apr. 28, 2015, 112:13455-13460. [cited by applicant]
Giusti et al., “Two's company, three (or more) is a simplex,” Journal of computational neuroscience, Aug. 2016, 41(1):1-14. [cited by applicant]
Gleeson et al., “Open Source Brain: A Collaborative Resource for Visualizing, Analyzing, Simulating, and Developing Standardized Models of Neurons and Circuits,” Neuron, Aug. 7, 2019, 103(3):395-411.e5. [cited by applicant]
Gong, “Evolution to a small-world network with chaotic units,” Europhysics Letters (EPL), Jul. 15, 2004, 67:328-333. [cited by applicant]
Goodman et al., “Brian: a simulator for spiking neural networks in python,” Frontiers in Neuroinformatics, Sep. 30, 2008, 2(5):1-10. [cited by applicant]
Graves, “Adaptive computation time for recurrent neural networks,” ar Xiv preprint arXiv: 1603.08983, Mar. 29, 2016, 19 pages. [cited by applicant]
Gripon et al., “Sparse Neural Networks with Large Learning Diversity,” IEEE Transactions on Neural Networks, Jul. 2011, 22(7):1087-1096. [cited by applicant]
Gros et al., “Semantic learning in autonomously active recurrent neural networks,” Logic Journal of IGPL, Oct. 1, 2010, 18(5):686-704. [cited by applicant]
Gros, “Cognitive computation with autonomously active neural networks: an emerging field,” Cognitive Computation, Mar. 2009, 1(1):77-90. [cited by applicant]
Gros, “Neural networks with transient state dynamics,” New Journal of Physics, Apr. 30, 2007, 9(4):109, 21 pages. [cited by applicant]
Gros, “Self-sustained thought processes in a dense associative network,” In Annual Conference on Artificial Intelligence, Sep. 11, 2005, Springer, Berlin, Heidelberg, 14 pages. [cited by applicant]
Guerreiro et al., “A Neural Key Generator for a Public Block Cipher,” IEEE Ninth Brazilian Symposium on Neural Networks (SBRN '06), Oct. 23-27, 2006, Ribeirao Preto, BR, 143-147. [cited by applicant]
Guerreno, “The sleep onset transition: a connectivity investigation built on EEG source localization,” University of Zurich, Facult of Science, Aug. 6, 2018, pp. 1-292. [cited by applicant]
Harris et al. “The neocortical circuit: themes and variations,” Nat. Neurosci., Jan. 27, 2015, 18:170-181. [cited by applicant]
Hastings et al., “Challenges in the analysis of complex systems: introduction and overview,” The European Physical Journal Special Topics, Dec. 28, 2017, 226:3185-3197. [cited by applicant]
Hatcher, “Algebraic Topology,” Cambridge University Press, Feb. 2002, 556 pages. [cited by applicant]
Haun et al., “Conscious Perception as Integrated Information Patterns in Human Electrocorticography,” eNeuro: Cognition and Behavior, Sep. 19, 2017, 4:2-18. [cited by applicant]
Hebb, “The Organization of Behavior: A Neuropsychological Theory,” New York, NY: Wiley & Sons, 1949, pp. 1-365. [cited by applicant]
Holtmaat et al., “Experience-dependent structural synaptic plasticity in the mammalian brain,” Nat. Rev. Neurosci., Sep. 10, 2009, 10: 647-658. [cited by applicant]
Hu et al., “Local paths to global coherence: cutting networks down to size,” Phys. Rev. E, Mar. 10, 2014, 89: 1-16. [cited by applicant]
Ibanze-Marcelo et al., “Topology highlights mesoscopic functional equivalence between imagery and perception: The case of hypnotizability,” NeuroImage, Jun. 19, 2019, 437-449. [cited by applicant]
Ignacio et al., “Classification of Single-lead Electrocardiograms: TDA Informed Machine Learning,” ArXiv, Nov. 25, 2019, pp. 1-6. [cited by applicant]
Ignacio et al., “Tracing patterns and shapes in remittance and migration networks via persistent homology,” EPJ Data Science, Jan. 5, 2019, 8:1-25. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2020/056588, dated Sep. 30, 2021, 8 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2019/064593, dated Dec. 24, 2020, 11 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2019/064740, dated Dec. 24, 2020, 11 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2019/064741, dated Dec. 24, 2020, 9 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2019/064773, dated Dec. 24, 2020, 11 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2019/064776, dated Dec. 24, 2020, 11 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2020/056686, dated Sep. 30, 2021, 10 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2020/085007, dated Jun. 23, 2022, 8 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2020/085016, dated Jun. 23, 2022, 11 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2020/085169, dated Jun. 23, 2022, 8 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2020/085200, dated Jun. 23, 2022, 9 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2020/085434, dated Jun. 23, 2022, 9 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2020/085716, dated Jun. 23, 2022, 11 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2020/085750, mailed on Jun. 23, 2022, 8 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2020/085754, mailed Jun. 23, 2022, 12 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2020/085762, mailed on Jun. 23, 2022, 7 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2019/064593, dated Sep. 6, 2019, 18 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2019/064740, dated Sep. 6, 2019, 18 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2019/064741, dated Sep. 6, 2019, 16 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2019/064773, dated Sep. 6, 2019, 17 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2019/064776, dated Sep. 6, 2019, 17 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2020/056588, dated May 26, 2020, 12 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2020/056686, dated May 26, 2020, 13 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2020/085007, dated Mar. 24, 2021, 10 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2020/085016, dated Mar. 24, 2021, 18 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2020/085169, dated Mar. 18, 2021, 15 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2020/085200, dated Apr. 9, 2021, 15 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2020/085434, dated Mar. 24, 2021, 16 pages. [cited by applicant]