Patent Publication Number: US-2021192346-A1

Title: Establishing a Trained Machine Learning Classifier in a Blockchain Network

Description:
RELATED APPLICATION 
     This application is a continuation of U.S. Non-Provisional patent application Ser. No. 16/740,350, titled “ESTABLISHING A TRAINED MACHINE LEARNING CLASSIFIER IN A BLOCKCHAIN NETWORK”, filed Jan. 10, 2020 (Attorney Docket No. LEDG 1001-3), which claims the benefit of U.S. Provisional Patent Application No. 62/844,691, titled “NEURAL NETWORK TRAINED CLASSIFIER FOR BLOCK CHAIN DOCUMENTS TRACKING”, filed May 7, 2019 (Attorney Docket No. LEDG 1001-1). The non-provisional and provisional applications are incorporated herein by reference in its entirety for all purposes. 
    
    
     INCORPORATIONS 
     The following materials are incorporated herein by reference in their entirety for all purposes: 
     The FDA Product-Specific Guidance database, fda.gov/drugs/guidances-drugs/product-specific-guidances-generic-drug-development. 
     Andy Greenberg, “SECURITY SOFTWARE HAS A SERIOUS SUPPLY-CHAIN SECURITY PROBLEM”, Wired (Sep. 18, 2017); 
     Andy Greenberg, “SUPPLY CHAIN HACKERS SNUCK MALWARE INTO VIDEOGAMES”, Wired (Apr. 23, 2019); 
     X. Zhang, X. Zhou, M. Lin, and J. Sun, “ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devices,” in arXiv:1707.01083, 2017; 
     A. G. Howard, M. Zhu, B. Chen, D. Kalenichenko, W. Wang, T. Weyand, M. Andreetto, and H. Adam, “Mobilenets: Efficient Convolutional Neural Networks for Mobile Vision Applications,” in arXiv:1704.04861, 2017; 
     M. Sandler, A. Howard, M. Zhu, A. Zhmoginov, and L. Chen, “MobileNetV2: Inverted Residuals and Linear Bottlenecks,” in arXiv:1801.04381v3, 2018; 
     Z. Qin, Z. Zhang, X. Chen, and Y. Peng, “FD-MobileNet: Improved MobileNet with a Fast Downsampling Strategy,” in arXiv:1802.03750, 2018; 
     K. He, X. Zhang, S. Ren, and J. Sun, “Deep Residual Learning for Image Recognition,” in Proc. of CVPR, 2016; 
     K. He, X. Zhang, S. Ren, and J. Sun, “DEEP RESIDUAL LEARNING FOR IMAGE RECOGNITION,” arXiv:1512.03385, 2015; 
     J. Wu, “INTRODUCTION TO CONVOLUTIONAL NEURAL NETWORKS,” Nanjing University, 2017; 
     I. J. Goodfellow, D. Warde-Farley, M. Mirza, A. Courville, and Y. Bengio, “CONVOLUTIONAL NETWORKS,” Deep Learning, MIT Press, 2016; 
     F. Yu and V. Koltun, “MULTI-SCALE CONTEXT AGGREGATION BY DILATED CONVOLUTIONS,” arXiv:1511.07122, 2016; 
     R. K. Srivastava, K. Greff, and J. Schmidhuber, “HIGHWAY NETWORKS,” arXiv: 1505.00387, 2015; 
     G. Huang, Z. Liu, L. van der Maaten and K. Q. Weinberger, “DENSELY CONNECTED CONVOLUTIONAL NETWORKS,” arXiv:1608.06993, 2017; 
     C. Szegedy, W. Liu,Y. Jia, P. Sermanet, S. Reed, D. Anguelov, D. Erhan, V. Vanhoucke, and A. Rabinovich, “GOING DEEPER WITH CONVOLUTIONS,” arXiv: 1409.4842, 2014; 
     S. Ioffe and C. Szegedy, “BATCH NORMALIZATION: ACCELERATING DEEP NETWORK TRAINING BY REDUCING INTERNAL COVARIATE SHIFT,” arXiv: 1502.03167, 2015; 
     Srivastava, Nitish, Hinton, Geoffrey, Krizhevsky, Alex, Sutskever, Ilya, and Salakhutdinov, Ruslan, “DROPOUT: A SIMPLE WAY TO PREVENT NEURAL NETWORKS FROM OVERFITTING,” The Journal of Machine Learning Research, 15 (1):1929-1958, 2014; 
     L. C. Piqueras, “AUTOREGRESSIVE MODEL BASED ON A DEEP CONVOLUTIONAL NEURAL NETWORK FOR AUDIO GENERATION,” Tampere University of Technology, 2016; 
     J. Gu, Z. Wang, J. Kuen, L. Ma, A. Shahroudy, B. Shuai, T. Liu, X. Wang, and G. Wang, “RECENT ADVANCES IN CONVOLUTIONAL NEURAL NETWORKS,” arXiv:1512.07108, 2017; 
     M. Lin, Q. Chen, and S. Yan, “Network in Network,” in Proc. of ICLR, 2014; 
     L. Sifre, “Rigid-motion Scattering for Image Classification,” Ph.D. thesis, 2014; 
     L. Sifre and S. Mallat, “Rotation, Scaling and Deformation Invariant Scattering for Texture Discrimination,” in Proc. of CVPR, 2013; 
     F. Chollet, “Xception: Deep Learning with Depthwise Separable Convolutions,” in Proc. of CVPR, 2017; 
     S. Xie, R. Girshick, P. Dollar, Z. Tu, and K. He, “Aggregated Residual Transformations for Deep Neural Networks,” in Proc. of CVPR, 2017; 
     F. Chaubard, R. Mundra, and R. Socher, “CS 224D: DEEP LEARNING FOR NLP, LECTURE NOTES: PART I,” 2015; 
     F. Chaubard, R. Mundra, and R. Socher, “CS 224D: DEEP LEARNING FOR NLP, LECTURE NOTES: PART II,” 2015; 
     F. Chaubard, R. Mundra, and R. Socher, “CS 224D: DEEP LEARNING FOR NLP, LECTURE NOTES: PART III,” 2015; 
     F. Chaubard, R. Mundra, and R. Socher, “CS 224D: DEEP LEARNING FOR NLP, LECTURE NOTES: PART IV,” 2015; 
     F. Chaubard, R. Mundra, and R. Socher, “CS 224D: DEEP LEARNING FOR NLP, LECTURE NOTES: PART V,” 2015; 
     A. van den Oord, S. Dieleman, H. Zen, K. Simonyan, O. Vinyals, A. Graves, N. Kalchbrenner, A. Senior, and K. Kavukcuoglu, “WAVENET: A GENERATIVE MODEL FOR RAW AUDIO,” arXiv:1609.03499, 2016; 
     S. Ö. Arik, M. Chrzanowski, A. Coates, G. Diamos, A. Gibiansky, Y. Kang, X. Li, J. Miller, A. Ng, J. Raiman, S. Sengupta and M. Shoeybi, “DEEP VOICE: REAL-TIME NEURAL TEXT-TO-SPEECH,” arXiv:1702.07825, 2017; 
     FIELD OF THE TECHNOLOGY DISCLOSED 
     The technology disclosed relates to artificial intelligence type computers and digital data processing systems and corresponding data processing methods and products for emulation of intelligence (i.e., knowledge based systems, reasoning systems, and knowledge acquisition systems); and including systems for reasoning with uncertainty (e.g., fuzzy logic systems), adaptive systems, machine learning systems, and artificial neural networks. In particular, the technology disclosed relates to using deep neural networks such as convolutional neural networks (CNNs) and fully-connected neural networks (FCNNs) for analyzing data. 
     BACKGROUND 
     The subject matter discussed in the background section should not be assumed to be prior art merely as a result of its mention in the background section. Similarly, a problem mentioned in the background section or associated with the subject matter of the background section should not be assumed to have been previously recognized in the prior art. The subject matter in the background section merely represents different approaches, which in and of themselves may also correspond to implementations of the claimed technology. 
     Increased regulation brings with it increased safety. But the increase in safety comes with a cost—greater reporting and administrative burden. Research by the Mercatus Center at George Mason University indicates that the accumulation of rules over the past several decades has slowed economic growth, amounting to an estimated $4 trillion loss in US GDP in 2012 (had regulations stayed at 1980 levels). 
     Conventional technologies fail to address the complexities of this challenging environment. For example, database systems (in cases where all players have access to a single database or must maintain their own database) require that each player take the time and energy to ensure they rules they use to update and utilize their database are in line with the most recent demands of regulators. 
     Diagnosis, analysis, and compliance historically require one human to have centralized access to all of other parties&#39; data. This represents a huge threat surface. In fact, according to a study by IBM, human error is the main cause of 95% of cyber security breaches. Further, compliance requires accurate input of information. Diagnosis requires voluminous amounts of data about complex topics, which are beyond the reaches of today&#39;s database servers. 
     What is really needed are improvements in gathering, synthesizing, and analyzing data, anomaly identification, exception handling and root cause analysis without compromising security that would significantly improve safety and security for compliance tracking and reporting. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       The patent or application file contains at least one drawing executed in color. Copies of this patent or patent application publication with color drawing(s) will be provided by the Office upon request and payment of the necessary fee. The color drawings also may be available in PAIR via the Supplemental Content tab. In the drawings, like reference characters generally refer to like parts throughout the different views. Also, the drawings are not necessarily to scale, with an emphasis instead generally being placed upon illustrating the principles of the technology disclosed. In the following description, various implementations of the technology disclosed are described with reference to the following drawings, in which: 
         FIG. 1A  shows an architectural level schematic of a system  100 A that implements a blockchain network of trusted actors. 
         FIG. 1B  shows an architectural level schematic of a system  100 B that implements a blockchain network that is publicly accessible in accordance with an alternative implementation. 
         FIG. 2A  is a flowchart illustrating a method for establishing a blockchain network implementing event detection, tracking and management for rule-based compliance, according to various embodiments. 
         FIG. 2B  is a flowchart illustrating a method for establishing a trained machine learning classifier using a blockchain network, according to various embodiments. 
         FIG. 2C  is a flowchart illustrating a method for establishing a trained machine learning classifier using unsupervised machine learning in a blockchain network. 
         FIG. 2D  is a flowchart illustrating a method for establishing a trained machine learning classifier using semi-supervised machine learning for classifying nodes in a blockchain network in a healthy blockchain network state(s) or an unhealthy blockchain network state(s). 
         FIG. 3A  illustrates a a representative neural network suitable for implementing the disclosed technology. 
         FIG. 3B  illustrates using a neural network for implementing autoencoding to detect a blockchain network health state of a block chain. 
         FIG. 3C  illustrates a deep learning system in a supervised or semi-supervised implementation. 
         FIG. 4A  is a flow diagram  400 A depicting an example permissioned blockchain transactions that can be used to implement the technology disclosed. 
         FIG. 4B  is a flow diagram  400 B depicting an example publicly accessible blockchain transactions that can be used to implement the technology disclosed. 
         FIG. 5  illustrates an example storage block of a blockchain network that implements the technology disclosed. 
         FIG. 6A  illustrates an example workflow  600  in which a smart contract  604 A implements the technology disclosed. 
         FIG. 6B  illustrates an example workflow  600  in which a smart contract  604 B implements the technology disclosed. 
         FIGS. 7A, 7B  depict example use cases  700 A,  700 B. 
         FIGS. 8A, 8B, 8C, 8D, 8E, 8F, 8G, 8H and 8I  depict screenshots displayed by a typical client device in conjunction with an example use case  800 . 
         FIG. 9  illustrates one implementation of a computer system  900  that can be used to implement the technology disclosed. 
         FIG. 10  illustrates an implementation of a convolutional neural network suitable for implementing the disclosed technology. 
         FIG. 11  depicts a block diagram of training a convolutional neural network in accordance with one implementation of the technology disclosed. 
         FIG. 12  shows one implementation of non-linear layers in accordance with one implementation of the technology disclosed. 
         FIG. 13  illustrates dilated convolutions. 
         FIG. 14  is one implementation of sub-sampling layers in accordance with one implementation of the technology disclosed. 
         FIG. 15  depicts one implementation of a two-layer convolution of the convolution layers. 
         FIG. 16  depicts a residual connection that reinjects prior information downstream via feature-map addition. 
         FIG. 17  depicts one implementation of residual blocks and skip-connections. 
         FIG. 18  illustrates stacks of convolutions permitted by theWaveNet in an implementation. 
         FIG. 19  depicts batch normalization forward pass f BN  in an implementation. 
         FIG. 20  illustrates batch normalization transform in an implementation. 
         FIG. 21  depicts backward pass computation. 
         FIG. 22  depicts a Batch Normalization Layer example. 
         FIG. 23  depicts a 1D convolution in an implementation. 
         FIG. 24  illustrates an implementation of global average pooling (GAP). 
     
    
    
     DETAILED DESCRIPTION OF SPECIFIC IMPLEMENTATIONS 
     Motivation 
     Disclosed are system and method implemented machine learning driven detection, classification, resolution and root cause analysis and blockchain-validated reporting enabling implementations to track and respond in near-real-time to anomalies such as out-of-spec asset reports in critically important supply scenarios without sacrificing security. The disclosed technology is applicable in drug and food shipments and military supply chains. 
     Introduction 
     The technology disclosed relates to machine learning-based systems and methods used for block chain validated documents, and more particularly to machine learning-based systems and methods using block chain to validate documents relating pharmaceuticals, artificial heart valves and other compositions, systems and apparatus for medical uses. Exceptions and anomalies are reported to regulatory bodies by multiple actors in a trusted block chain centric network. In particular, the technology disclosed facilitates identification of information pertaining to pharmaceuticals, artificial heart valves and other compositions, systems and apparatus for medical uses that find their way into anomaly reports and commercial data sources. Conducting analysis on inputs representing potentially anomalous data is described, applying at least one of unsupervised learning techniques, semi-supervised learning techniques to implement classifiers to classify data into nominal and anomalous data classifications. Classifier construction is based upon selective application of statistical machine learning, variational autoencoding, recurrent neural networks (RNN), convolutional neural networks (CNN), gaussian mixture models, other techniques, and combinations thereof. Application of classifiers so constructed enables automated systems to generate an output and triggering remedial actions procedures according to the output, along with pushing block level representations of at least some anomaly information into a blockchain network as described in a chain code or a smart contract. The terms chain code and smart contract will be used interchangeably herein. 
     System Overview 
     The technology disclosed describes system and method implementations of data origin authentication and machine data integrity using deep learning-based approaches to identify and isolate anomalies and to identify and trigger appropriate remedial actions including pushing block level representations of at least some anomaly information into a blockchain network as described in a smart contract.  FIG. 1  shows an architectural level schematic of a system in accordance with an implementation. Because  FIG. 1  is an architectural diagram, certain details are intentionally omitted to improve the clarity of the description. 
     The discussion of  FIG. 1  will be organized as follows. First, the elements of the figure will be described, followed by their interconnections. Then, the use of the elements in the system will be described in greater detail. 
       FIG. 1A  includes the system  100 A that implements a blockchain network of trusted actors. The system  100 A includes omni-directional interface server(s)  102 , anomaly information local store  104 , other servers and other entities that comprise a blockchain network  106 , client devices  122 , private storage server(s)  156  accessing private collections data stored for each organization, deep learning system  132  can be used to train one or more neural networks or other learning model(s)  134 , peer server(s)  136  that also include chain code (or smart contracts) implementing decentralized applications (DApps), ordering server(s)  146 , and Internet and/or other electronic communications network(s)  101 . 
     The interconnection of the elements of system  100 A will now be described. Network(s)  101  couples the interface server(s)  102 , the anomaly information local store  104 , with the other servers and other entities that comprise a blockchain network  106 , the client devices  122 , private storage server(s)  156  accessing private collections data stored for each organization, the deep learning system  132 , the learning model(s)  134 , peer server(s)  136  that also include chain code (or smart contracts) implementing the DApps, and the ordering server(s)  146 , that can be in communication with each other (indicated by solid double-arrowed lines). The actual communication path can be point-to-point over public and/or private networks comprising network(s)  101 . The communications can occur over a variety of networks, e.g., private networks, VPN, MPLS circuit, or Internet, and can use appropriate application programming interfaces (APIs) and data interchange formats, e.g., Representational State Transfer (REST), JavaScript Object Notation (JSON), Extensible Markup Language (XML), Simple Object Access Protocol (SOAP), Java Message Service (JMS), and/or Java Platform Module System. At least some of the communications can be encrypted. The communication is generally over a network such as the LAN (local area network), WAN (wide area network), telephone network (Public Switched Telephone Network (PSTN), Session Initiation Protocol (SIP), wireless network, point-to-point network, star network, token ring network, hub network, Internet, inclusive of the mobile Internet, via protocols such as EDGE, 3G, 4G LTE, Wi-Fi, and WiMAX. Additionally, a variety of authorization and authentication techniques, such as username/password, Open Authorization (OAuth), Kerberos, SecureID, digital certificates and more, can be used to secure the communications. The engines or system components of  FIGS. 1A and 1B  such as deep learning system  132 , private storage server(s)  156 , ordering server(s)  146 , peer server(s)  136  and the interface server(s)  102  are implemented by software running on varying types of computing devices. Example devices are a workstation, a server, a computing cluster, a blade server, and a server farm. 
     Interface server(s)  102 , associated by a set of trust relationships with peer server(s)  136 , and other servers and other entities, comprise the blockchain network  106 , that acts as a distributed database or an immutable ledger which maintains records of all electronic transactions conducted by participants such as interface server(s)  102  and peer server(s)  136  in a peer-to-peer network. A blockchain is maintained by a network of nodes (e.g., interface server(s)  102 , peer server(s)  136 , etc.) where every node executes and records electronic transactions to a particular chain. The blockchain structure is replicated among the nodes in the network. Because blockchain network  106  implements a peer-to-peer network, it does not require a central authority or trusted intermediaries to authenticate or to settle the electronic transactions or control the underlying infrastructure. Examples of popular blockchain platforms include Hyperledger Fabric™, and Hyperledger Corda™, Ethereum™, Eris™, Multichain™, and Bitcoin™. Blockchain network  106  includes a distributed data structure (i.e., a “ledger” or “blockchain ledger”) comprising a chain of blocks. Servers implementing nodes of blockchain network  106  can host chain code or “smart contracts”. Chain code is a piece of code that resides on blockchain and is identified by a unique address. A chain code includes a set of executable functions and state variables. The function code is executed when transactions are sent to the functions. The transactions include input parameters which are required by the functions in the chain code. Upon the execution of a function, the state variables in the chain code change depending on the logic implemented in the function. Chain code can be written in various high-level languages (such as Golang™ or Solidity™ or Python™). Language-specific compilers for chain code (such as Golang™ or Solidity™ or Serpent™ compilers) are used to compile the chain code into bytecode. Once compiled, the chain code is uploaded to peer server(s)  136  of the blockchain network  106  which assign a unique address to each chain code. In permissioned blockchain systems, such as Hyperledger Fabric™, a node in the network can read electronic transactions for which it has permission. (In other blockchain systems, such as Ethereum™, all transactions are accessible to all nodes.) 
     The electronic transactions in the blockchain ledger are time-stamped and bundled into blocks where each block is identified by its cryptographic hash called the nonce. The blocks form a linear sequence where each block references the hash of the previous or parent block, forming a chain of blocks called the blockchain. Each block maintains records of all the transactions on the network received since the creation of its previous block. Instead of storing the information on all the transactions within the block itself, a special data structure called a Merkle tree is used to store the transactions and only the hash of the root of the Merkle tree is stored in the block. Blockchain is an immutable and durable data structure which maintains a record of the transactions that are tamper-resistant. Once a transaction is recorded in a block, it cannot be altered or deleted as long as a majority of the computational power of the network is not controlled by peers who collude to alter the blockchain. 
     Interface server(s)  102  can leverage blockchain platforms to enable device-to-device and data consumer-to-device electronic transactions. Interface server(s)  102  are preferably configured using application backend code  111  as proxies that have their own blockchain accounts for communicating with peer server(s)  136  in the blockchain network  106  and associated chain code (or smart contracts). The application chain code  112  can store information on the device identities and usage patterns of client devices  122 . Chain code versioning  116  keeps chain code of chain code libraries  114  deployed on Interface server(s)  102  compatible with chain code deployed on associated peer server(s)  136 , enabling one of the interface server(s)  102  of “Organization A” to send transactions to the associated chain codes deployed on “Organization A” peer server(s)  136 A and receive transactions from the peers of Organization A on the blockchain network  106 . Application backend code  111  enables this by running a blockchain client on the interface server(s)  102  that uses a controller service to connect the interface server(s)  102  with peer server(s)  136 A of Organization A and peer servers  136 B of Organization B, as well as any others that interface server(s)  102  are configured to be in a trusted entity with. An example of a blockchain client is Hyperledger Fabric™. (In alternative implementations, an EthJsonRpc Python™ client for Ethereum™ that uses JSON-based remote procedure calls (RPCs) to implement client-specific methods and provides a high-level interface to create smart contracts on Ethereum™ and to call contract functions.) 
     New blocks are created and added to the blockchain by participants (e.g., interface server(s)  102 , peer server(s)  136 ). In a permissioned blockchain platform, such as Hyperledger Fabric™, access to the blockchain network  106  is restricted only to a set of pre-defined participants. Participants may elect to permit new blocks to be created and added to the chain by any one of them without a consensus (called “No-op”) or to be added by meeting an agreement protocol, such as Practical Byzantine Fault Tolerance (PBFT). For example, two or more parties can agree on a key in such a way that both influence the outcome. This precludes undesired third parties from forcing a key choice on the agreeing parties. 
       FIG. 1B  illustrates a public or private without permissions blockchain platform, such as Ethereum™, suited for implementing the disclosed technology. The process of adding blocks to the blockchain in a public or private without permissions blockchain platform is called mining. As shown in  FIG. 1B , a plurality of distributed applications  136 B hosted on server(s) that are decentralized in nature, with no single entity or organization controlling the infrastructure on which the blocks are stored.  FIG. 4B  is a block diagram  400 B with an example distributed application(s)  136 B that can be used to host smart contracts that implement nodes in the blockchain network that perform the mining operations are called miners. New transactions are broadcast to all the nodes on the network. Each miner node creates its own block by collecting the new transactions and then finds a proof-of-work (PoW) for its block by performing complex cryptographic computations. The miners validate the transactions and reach a consensus on the block that should be added next to the blockchain. The newly mined block, called the winning block, is then broadcast to the entire network. The winning block is the one that contains a PoW of a given difficulty. 
     While each miner on the blockchain network  106  can create its own block, only the block which has a PoW of a given difficulty is accepted to be added to the blockchain. The consensus mechanism ensures that all the nodes agree on the same block to contain the canonical transactions. Blockchain offers enhanced security as compared to centralized systems as every transaction is verified by multiple miners. The integrity of the transaction data recorded in the blocks is protected through strong cryptography. In addition to the transaction data, each block contains a cryptographic hash of itself and the hash of the previous block. Any attempts to modify a transaction would result in a change in the hash and would require all the subsequent blocks to be recomputed. This would be extremely difficult to achieve as long as the majority of miners do not cooperate to attack the network. 
     In implementations, data too sensitive to risk being stored directly on the blocks of the blockchain network  106  can be stored locally in local store(s)  104 . For example, medical privacy laws such as health insurance portability and accountability act (HIPAA), general data protection regulation (GDPR), and others, legal, regulatory or private, place restrictions on the usage and keeping of data. In such cases, information can be stored locally by participants in the blockchain network  106  in local store(s)  104 . Addressing information can be pushed by the custodian of the locally stored data, typically in encrypted or other non-human readable form to provide protection from tampering by a single actor and provides for data confidentiality with encryption at the block level. 
     When client devices  122  wish to avail the services of the interface server(s)  102 , these devices execute application software implementing web applications, mobile applications, event subscriber (user, automation, business applications), automated applications and the like to authenticate with user authentication code  113 . Once authenticated, the authenticated device is enabled to conduct data transactions via the chain code  112  associated with the interface server(s)  102 . The interface server  102 , will obtain services on behalf of the authenticated device, effectively blocking direct linking between user device and nodes in the block chain. For example, one of the client devices  122  accesses the system using an application deployed on a workstation or mobile devices and driven by the interface server(s)  102  accessed over network  101 . The mobile application, when backed by the interface server(s)  102 , reads barcodes on questionable package and gathers user information enabling the interface server(s)  102  to obtain using neural networks implementing learning models  134  diagnostic information and applications that can trigger remedial action, such as completing a discrepancy report. One implementation can enable photos of barcodes to be taken by a third party, optical character recognition of the human-readable label, and XML or other machine files with the same information. One implementation provides pill recognition using image recognition driven CNN classifiers of learning models  134  trained using ground truth training sets drawn from publicly available and/or other image recognition frameworks. One implementation provides client devices  122  at the reporting party with a series of learning model  134  selected modal screens, enabling client devices  122  to accurately and rapidly notify regulators and counter-parties (“trading partners”) of problems. 
     Ordering server(s)  146  are used by interface server(s)  102  to request transactions with the peer server(s)  136  to retrieve or store information, such as anomaly reports, to the block chain ledger. In this manner the identities of the peer server(s)  136  are anonymized and known to the ordering server(s)  146  in the tamper-proof blockchain network  106 . 
     Private storage server(s)  156  access private collections data stored for each organization, which may comprise information of various drug databases (e.g., the FDA Product-Specific Guidance database, which enables searching and clustering by active ingredient(s)) and communications including machine reading of emails on recalls. Interface server(s)  102  is cooperatively coupled with private storage server(s)  156  that can comprise multiple sources of data stored by individual organizations that are members of the blockchain network  106 , thereby minimizing the need to change notification protocols that can be related to machine-readable data and image recognition (e.g. images of pills). 
     Learning model(s)  134  in conjunction with event hub  115  enable interface server(s)  102  to apply machine learning techniques (cluster identification, free form input learning) to observational global state of the block level events in the block chain, input of responses to follow-up questions obtained from user responses and actions, to identify anomalies, and decide when to gather additional information and/or filing a report to another entity int the blockchain network  106 . Learning model(s)  134  implement unsupervised and transitioning to semi-supervised machine learning techniques, thereby enabling (re-)training and refinement to occur. 
     In one implementation, learning model(s)  134  implement multi-layer ensembles of neural subnetworks includes a first anomaly subnetwork, and a second solution accessibility subnetwork. The learning model(s)  134  are further configured to classify inputs indicating various anomalous sensed conditions into probabilistic anomalies using a first anomaly subnetwork. Determined probabilistic anomalies may be classified into remedial application triggers. Remedial application triggers are invoked to recommend or take actions to remediate, and/or report the anomaly. One implementation the learning model(s)  134  can select a report type to submit based upon the situation state. One implementation can select a report recipient based upon the situation state. For example within the drug and healthcare reporting field, learning model(s)  134  can address reporting among both professionals and consumers: FDA: Field Alert Report (FAR), FDA: Biological Product Deviation Report (BPDR), FDA: Form 3500 (Medwatch, voluntary reporting by healthcare professionals, consumers, and patients), FDA: Form 3500A (Medwatch, mandatory reporting by IND reporters, manufacturers, distributors, importers, and user facilities personnel), FDA: Form 3500B (Medwatch, voluntary reporting by consumers), FDA: Reportable Food Registry, FDA: Vaccine Adverse Event Reporting System (VAERS), FDA: Investigative Drug/Gene Research Study Adverse Event Reports, FDA: Potential Tobacco Product Violations Reporting (Form FDA 3779), USDA APHIS Center for Veterinary Biologics Reports, USDA Animal and Plant Health Inspection Service: Adverse Event Reporting, USDA FSIS Electronic Consumer Complaints, DEA Tips, Animal Drug Safety Reporting, Consumer Product Safety Commission Reports, State/local reports: Health Department, Board of Pharmacy, and others. 
     The deep learning system  132  trains some of the learning model(s)  134  implementing neural networks in semi-supervised modalities to recognize anomalies and trigger remedial actions. In one implementation, neural networks are trained on one or more training servers (e.g.,  302  of  FIG. 3 ) using training datasets (e.g.,  312  of  FIG. 3 ) and deployed on one or more production servers (e.g.,  304  of  FIG. 3 ). 
     Having presented a system overview, the discussion now turns to establishing a learning model to recognize reportable anomalies and trigger remedial actions. 
     Learning Models 
     Implementation specifics will differ widely by application, however anomaly recognition and remediation generally include embodiments in which interface server(s)  102  implement via learning model(s)  134  a statistical learning based process (e.g., an “AI agent”) that performs tracking a global state of events in an accessed block chain, identifying anomalies, and deciding to trigger gathering additional information and/or filing a report to another entity. Data points in the events of the accessed block chain are represented by a vector (more generally a tensor) for each data point. Data points in the events can include structured or unstructured data; each can be manipulated using different methods. Programming a mapping to map “structured data” to a vector representation will capture the relevant data of an object, e.g., what&#39;s gleaned from scanning a bar code can be mapped to fields in the vector. A pre-trained model can be applied to map unstructured data to a vector (or tensor) representation. 
     Implementations at the start of their deployment, experience a dearth of labeled data from which to make decisions. Over time, however, as the implementation processes data and takes actions, e.g., detecting events, classifying events as anomalies, and triggering reporting of the anomalies, the results of these actions will produce labelled data. The dynamics of this process mean that implementations starting with an unsupervised learning processes and transition to a semi-supervised learning processes over time with usage. Unsupervised learning processes take similar pieces of data and map them to mathematical objects that are just as similar. Semi-supervised learning processes are applied to instances where some labels are applied to the data, but there are far more unlabeled data than labelled ones. 
       FIG. 2A  is a flowchart illustrating a method for establishing a blockchain network implementing event detection, tracking and management for rule-based compliance, according to various embodiments. Accordingly, in the flowchart  200 A, at block  201 , a blockchain ledger  106  of  FIG. 1A ,  FIG. 1B  is provided to a plurality of blockchain nodes (e.g.,  102 ,  136  of  FIG. 1A ,  FIG. 1B ). 
     In block  202 , public and private key pairs are provided to at least one of the blockchain nodes  102  of  FIG. 1A ,  FIG. 1B  for authentication of blockchain communications. In various embodiments, private keys are for storage in, or in a manner accessible to, a communication device associated with an entity  102  of  FIG. 1A ,  FIG. 1B . 
     In block  203 , the blockchain network in conjunction with a set of distributed machine implemented applications (DApps) (e.g.,  112  of  FIG. 1A, 114  of  FIG. 1A, 115  of  FIG. 1A ) communicating with the blockchain nodes, implements event detection, tracking and management. 
     In block  204 , the event hub  115  of  FIG. 1A  detects at least one of a set of block-level events recorded in the blockchain ledger provided to the blockchain nodes. A block in the blockchain ledger corresponds to one of the set of block-level events includes at least an event type data and a set of event data related to the event type data. The at least one of a set of block-level events is received from a blockchain server (e.g.,  102 ,  136  of  FIG. 1A ,  FIG. 1B ) of the blockchain network  106  of  FIG. 1A ,  FIG. 1B . 
     In block  205 , at least one of the set of distributed machine implemented applications (DApps) (e.g.,  112  of  FIG. 1, 114  of  FIG. 1, 115  of  FIG. 1A ) communicating with the blockchain nodes classifies the at least one of a set of block-level events by applying at least the event type data as an input to determine an output of a situation state. 
     In block  206 , triggering an application resident on a server external to the blockchain network to perform one or more actions in dependence upon the situation state as output by the classifier (e.g.,  112  of  FIG. 1A, 114  of  FIG. 1A, 115  of  FIG. 1A ). 
       FIG. 2B  is a flowchart illustrating a method for establishing a trained machine learning classifier using a blockchain network, according to various embodiments. Accordingly, in the flowchart  200 B, at block  211 , a blockchain ledger storing at least pointers to a plurality of documents  106  of  FIG. 1A ,  FIG. 1B  is provided to a plurality of blockchain nodes (e.g.,  102 ,  136  of  FIG. 1A ,  FIG. 1B ). 
     In block  212 , public and private key pairs are provided to at least one of the blockchain nodes  102  of  FIG. 1A ,  FIG. 1B  for authentication of blockchain communications. In various embodiments, private keys are for storage in, or in a manner accessible to, a communication device associated with an entity  102  of  FIG. 1A ,  FIG. 1B . 
     In block  213 , the blockchain network in conjunction with a set of distributed machine implemented applications (DApps) (e.g.,  112  of  FIG. 1A, 114  of  FIG. 1A, 115  of  FIG. 1A ) communicating with the blockchain nodes, implements establishing a trained machine learning classifier. 
     In block  214 , the event hub  115  of  FIG. 1A  detects data from investigative situations including sensed or measured conditions in a physical object or a physical process, and conclusions, outcomes or actions in documents stored by at least one of a set of block-level events recorded in the blockchain ledger provided to the blockchain nodes. The data can include captured evidence of the sensed or measured conditions. The at least one of a set of block-level events is received from a blockchain server (e.g.,  102 ,  136  of  FIG. 1A ,  FIG. 1B ) of the blockchain network  106  of  FIG. 1A ,  FIG. 1B . 
     In block  215 , at least one of the set of distributed machine implemented applications (DApps) (e.g.,  112  of  FIG. 1, 114  of  FIG. 1, 115  of  FIG. 1A ) communicating with the blockchain nodes labels the data from investigative situations by applying labels selected from a ground truth dataset. 
     In block  216 , a classifier including a neural network is trained with at least some datapoints of the data from investigative situations and corresponding labels (e.g.,  112  of  FIG. 1A, 114  of  FIG. 1A, 115  of  FIG. 1A ). 
       FIG. 2C  is a flowchart illustrating a method for establishing a trained machine learning classifier using unsupervised machine learning in a blockchain network. The blockchain network can implement event detection, tracking and management for situation analysis. According to various embodiments, data from clinical trials can be developed into classifiers suited for semi-supervised and supervised machine learning applications by application of unsupervised machine learning techniques. 
     Accordingly, in the flowchart  200 C, at block  221 , a blockchain ledger  106  of  FIG. 1A ,  FIG. 1B  is provided to a plurality of blockchain nodes (e.g.,  102 ,  136  of  FIG. 1A ,  FIG. 1B ). The blockchain ledger is preferably storing at least addressing information or pointers to a plurality of documents. Documents can include documents such as clinical trial documents, reports made by governmental agencies, papers published by universities, and so forth. 
     In block  222 , an unsupervised machine statistical learning model suite (e.g.,  134  of  FIG. 1A ,  FIG. 1B ) is applied to the documents stored in the blockchain ledger to develop patterns of data recognized from in the documents. Data points in the documents can include structured or unstructured data; each can be manipulated using different methods. 
     In block  223   a , fields of structured data type data points are mapped into fields of a first tensor representation. Programming a mapping to map “structured data” to a vector representation will capture the relevant data of an object, e.g., what&#39;s gleaned from scanning a bar code can be mapped to fields in the vector. 
     In block  223   b , encoding unstructured data type data points into fields of a second tensor representation. A pre-trained model can be applied to map unstructured data to a vector (or tensor) representation. For example, for textual data, an ‘encoder’ model takes as input text and maps it to a relatively small vector. A ‘decoder’ model takes as input that vector and maps it back to text. By training both networks (e.g., encoder, decoder) to minimize the difference between the reconstructed text and the input text, results in an encoder that learns how to represent such text as a tiny vector. This resulting tiny vector can be appended to any other vector. This technique also is effective for images and other unstructured data. The general concept of taking data, mapping it to a small vector(s), and back to itself in order to learn how to represent it as vectors is called autoencoding. 
     In block  224 , patterns indicating clusters of data are identified in the data points associated with the first tensor representation and the second tensor representation, and a label is applied to each cluster. Numerous possible factors and patterns identified using a statistical model, such as a neural network, kernel method, or a Principal Component Analysis (PCA) to map block level data into a latent vector space. Patterns identified can be investigated by reading/writing from other nodes in the blockchain ledger of blockchain network ( 106  of  FIG. 1A ,  FIG. 1B ) to find like data and reveal previous labelling, and/or treatments of such like data. Meaning can be assigned to the patterns identified, based on the results of such investigations. Such conclusions can be written to a datastore that interface server(s)  102  has access. 
     In block  225   a , at least one selected from k-means clustering, and a gaussian mixture model, is used to identify at least one semantically meaningful pattern indicating an event in the data as represented by the first tensor and the second tensor. 
     In block  225   b , natural language data is regularized using labels assigned to clusters of semantically similar data. 
     In block  225   c , an autoencoder network is used to identify data points of a certain Mahalanobis distance from data clusters labelled as desirable. Autoencoders can be implemented by neural networks that take as input the data, map it to small vectors and back to itself in order to learn how to represent it as vectors. In one implementation and by way of example, in an autoencoder is trained to represent a clinical study summary as a small vector, the text encoder (e.g. implemented using an RNN or Transformer) creates a 50-dimensional vector representing the text of the study, and appends to it a one dimensional vector that represents the outcome score. The 51-dimensional vector that results, termed a latent vector, captures both components of information of the study, and can serve as input to another model. An autoencoder implementation is described in further detail herein with reference to  FIG. 2D . 
     In block  226 , a classifier is developed by continuously training a classifier including a neural network with at least some of the clusters and the labels. A classifier can now be trained (or retrained) on the labelled patterns identified, by accessing a privileged datastore. Training a classifier is described in further detail hereinbelow with reference to  FIG. 3C . 
     In block  227 , the developed classifiers are applied to data points in additional documents to determine events of interest and triggering an application resident on a server external to the blockchain network to perform one or more actions in dependence upon the output by the classifier. For example, interface server(s)  102  can proactively act on identified events of interest discovered by reading/writing from the blockchain  106 . 
     Cluster Identification. 
     In an implementation, block level events are detected in the blockchain ledger by clustering the blocks according to numerous possible factors and patterns identified using a statistical model, such as a neural network, kernel method, or a Principal Component Analysis (PCA) to map block level data into a latent vector space: 
       FIG. 3A  illustrates a representative neural network suitable for implementing the disclosed technology. Neural network  300 A is a fully connected neural network with multiple layers. A neural network is a system of interconnected artificial neurons (e.g., a 1 , a 2 , a 3 ) that exchange messages between each other. Neural network  300 A has three inputs, two neurons in the hidden layer and two neurons in the output layer. The hidden layer has an activation function f(⋅) and the output layer has an activation function g(⋅). The connections have numeric weights (e.g., w 11 , w 21 , w 12 , w 31 , w 22 , w 32 , v 11 , v 12 , v 21 , v 22 ) that are tuned during the training process, so that a properly trained network responds correctly when fed an image to recognize. The input layer processes the raw input, the hidden layer processes the output from the input layer based on the weights of the connections between the input layer and the hidden layer. The output layer takes the output from the hidden layer and processes it based on the weights of the connections between the hidden layer and the output layer. The network includes multiple layers of feature-detecting neurons. Each layer has many neurons that respond to different combinations of inputs from the previous layers. These layers are constructed so that the first layer detects a set of primitive patterns in the input image data, the second layer detects patterns of patterns and the third layer detects patterns of those patterns. 
     Kernel methods include the classifier begins with the i-th training example, (x i , y i ) learns for it a corresponding weight w i . Prediction for unlabeled inputs, i.e., those not in the training set, is treated by the application of a similarity function k, called a kernel, between the unlabeled input x′ and each of the training inputs x i  An example kernel binary classifier computes a weighted sum of similarities: 
     
       
         
           
             
               y 
               ^ 
             
             = 
             
               sgn 
                
               
                 
                   ∑ 
                   
                     i 
                     = 
                     1 
                   
                   n 
                 
                  
                 
                   
                     w 
                     i 
                   
                    
                   
                     y 
                     i 
                   
                    
                   
                     k 
                      
                     
                       ( 
                       
                         
                           X 
                           i 
                         
                          
                         
                           X 
                           ′ 
                         
                       
                       ) 
                     
                   
                 
               
             
           
         
       
     
     where: ŷ ∈ {−1, +1} is the kernelized binary classifiers predicted label for the unlabeled input x′, k: X×X→R is the kernel function that measures similarity between any pair of inputs x, x′ ∈ X i ; the sum ranges over the n labeled examples {(x i , y i )} i=1   n  in the classifier&#39;s training set, with y i  ∈ {−1, +1}; the w i  ∈ R are the weights for the training examples, as determined by the learning algorithm; the sign function sgn determines whether the predicted classification ŷ comes out positive or negative. Reference may be had by persons skilled in the art to Wikipedia, en.wikipedia.org/wiki/Kernel_method, for further information concerning kernel method. 
     Principal Component Analysis (PCA) is mathematically defined as an orthogonal linear transformation that transforms the data to a new coordinate system such that the greatest variance by some scalar projection of the data comes to lie on the first coordinate (called the first principal component), the second greatest variance on the second coordinate, and so on. In one implementation, a p-dimensional ellipsoid is fit to the data, where each axis of the ellipsoid represents a principal component. If some axis of the ellipsoid is small, then the variance along that axis is also small, and by omitting that axis and its corresponding principal component from our representation of the dataset, we lose only an equally small amount of information. Reference may be had by persons skilled in the art to Wikipedia, en.wikipedia.org/wiki/Principal_component_analysis for further information concerning principle component analysis. 
     At this point, an unsupervised learning algorithm such as k-means clustering, or a gaussian mixture model is used to identify in the data semantically meaningful patterns indicating an event. For example, similarities identified in clusters indicate an event, e.g. a headache after taking pills could be clustered to a lot (i.e., bad production event), to a time (swapped pills event), or to a location (damaged while shipping event). Each field in the FDA 3911 report would be tagged in a block level data structure that can be shared on the blockchain. Implementations can enable easier sorting of events and issuing notifications. For example, a rash of seemingly unrelated events in the opiate category might point back to a specific problematic manufacturing lot, while other correspondences between reports could reveal fraudulent activity. 
     Regularizing Free-Form Typical Input Learning. 
     People have many different ways of describing the same thing, which can confound traditional reporting systems. The system could regularize input by suggesting typical responses and verifying hypothesized clusters by suggesting responses. One implementation can regularize data by mapping it into a semantically meaningful vector space, learned from a large corpus of data. In the case of “regularizing” natural language input, this may be a space learned from training a sequence to sequence model statistical model/neural network to encode text to a vector and that vector back to the original text. The resultant vectors encode the ‘meaning’ of the input text. As such, similar text inputs can be easily grouped together. If those groups are labelled, the labels can be easily suggested. (For instance, a user may write “pills look weird,” the system might suggest “damaged pills” or “pills look different than normal” as options. Using natural-language generation, the AI would then ask several follow-up questions to look for a match that builds out a cluster and provides context for its image-recognition efforts.) 
     Autoencoder Network for Bad Actor Identification 
       FIG. 2D  is a flowchart illustrating a method for establishing a trained machine learning classifier using unsupervised machine learning for classifying nodes in a blockchain network in a healthy blockchain network state(s) or an unhealthy blockchain network state. The blockchain network can implement event detection, tracking and management for situation analysis or other purposes. According to various embodiments, data from compliance reporting, data from clinical trials, and/or data from manufacturing and distribution processes can be developed into classifiers suited for semi-supervised and supervised machine learning applications by application of unsupervised machine learning techniques. 
     Accordingly, in the flowchart  200 D, at block  231 , a blockchain ledger  106  of  FIG. 1A ,  FIG. 1B  is provided to a plurality of blockchain nodes (e.g.,  102 ,  136  of  FIG. 1A ,  FIG. 1B ). The blockchain ledger is preferably storing at least addressing information or pointers to a plurality of documents. Documents can include documents such as clinical trial documents, reports made by governmental agencies, papers published by universities, reports created or managed by participants in the course of manufacturing and distribution processes, and so forth. 
     In block  232 , an autoencoder semi-supervised statistical machine learner is applied to the documents stored in the blockchain ledger (e.g., pointed upon or stored in accordance with) to develop patterns of data recognized from in the documents. The autoencoder can be stand alone or a component of an unsupervised machine statistical learning model suite (e.g.,  134  of  FIG. 1A ,  FIG. 1B ). One implementation of an autoencoder semi-supervised statistical machine learner is representative neural network  311  illustrated by  FIG. 3B , in which a neural network  311  is used for implementing autoencoding to detect anomalous data, such as a spam, corrupt data, or data indicative of an anomaly in compliance reporting, data from clinical trials, and/or data from manufacturing and distribution processes or other bad data in the block chain. 
     In block  233   a , autoencoder neural network  311  (e.g., based on an RNN or transformer) is trained on ‘healthy’ blockchain data x h . Healthy blockchain data x h , while application dependent, can include specific params such as transactions against the blockchain ledger per second, percentage of transactions recorded in the blockchain ledger that include transactions between pharmaceutical suppliers and wholesalers, percentage of transactions recorded in the blockchain ledger that include transactions between wholesaler and pharmacy, percentage of transactions recorded in the blockchain ledger that include transactions between pharmaceutical manufacturer and wholesalers. Number of transactions recorded in the blockchain ledger that include transactions occurring between industry participants and others. While neural network autoencoder  311  is illustrated generally with 3 input nodes, 2 internal or hidden nodes and 3 output nodes, implementations will include different and varying configurations. For example, one implementation might receive data x comprising 1024-dimensional data, compress the data to latent vectors  305 , which may be as small as single dimensional data, and then re-inflate the data to output data x 1  of 1024 dimensions. 
     In block  234   a  a ‘reconstruction loss’ ∥x h −x h   1 ∥ of the autoencoder is measured on the healthy data x h . The classifier, having been trained on ‘healthy data’—e.g., data for a blockchain in normal state—only, will not reconstruct input for unhealthy data as well as healthy data at run time. In a block  235   a , when the autoencoder is deployed a blockchain in a normal or healthy blockchain state will exhibit a minimal reconstruction loss, i.e., min ∥x h −x h   1 ∥. If the ‘reconstruction loss’ is substantially higher on data during deployment, e.g., against a threshold, and/or the blockchain is in an unhealthy blockchain state; in such case, the blockchain system is deemed to be ‘unhealthy’ or ‘under attack’. 
     In block  233   b , alternatively when a set of historical training data is available, the encoder section  301  of the autoencoder network  311  is used to encode all data (e.g., healthy x h  and unhealthy x u ) to a set of latent vectors  305 . A classifier is trained on the latent vectors, labelled with whether they represent a ‘normal’ or ‘abnormal’ blockchain state. In a block  234   b , the trained classifier can deployed to classify input data as either normal or abnormal. 
     In a block  233   c , alternatively the encoder  301  is used to encode all data (e.g., healthy x h  and unhealthy x u ) at deploy time to a latent space  307 . In latent space  307 , latent vectors  305   h  will cluster about one another. In block  234   c , data points of a certain Mahalanobis (or other metric) distance from data clusters labelled as desirable are identified. Latent vectors  305   u  that are, according to some distance metric (e.g. L2 or Mahalanobis distance) far from ‘healthy’ data points are deemed to be ‘unhealthy’ or as ‘resulting from an attack’. 
     In block  236 , a classifier is developed by continuously training a classifier including a neural network with at least some of the clusters and the labels. A classifier can now be trained (or retrained) on the labelled patterns identified, by accessing a privileged datastore. Training a classifier is described in further detail hereinbelow with reference to  FIG. 3C . 
     In block  237 , the developed classifiers are applied to data points in additional documents to determine events of interest and triggering an application resident on a server external to the blockchain network to perform one or more actions in dependence upon the output by the classifier. For example, interface server(s)  102  can proactively act on identified events of interest discovered by reading/writing from the blockchain  106 . 
     Accordingly, implementations employing the foregoing disclosed technology can identify spam transactions on the blockchain ledger, employ learned data stored with user identity to verify claimed identity, compute confidence scores to score transactions, and automatically trigger mitigating actions to be taken by downstream applications (e.g. forced slowing of transaction rate or flagging a suspicious user for review). Atypical transactions can be flagged for possible review to catch malicious activity. In other usage scenarios, one implementation of an encoder neural network enabled interface server(s)  102  can identify improper behavior such as forced shortages and front-running. 
     Convolutional Neural Network (CNN) 
     One implementation of a neural network enabled interface server triggers prompts asking for the submitting parties to take photos and use image recognition to identify classes of problems and highly probable matches. A convolutional neural network is trained on a curated database of pill photos, labelled with defects. If defects are rare, examples of defective pills may be oversampled to provide the network with adequate inputs during training. The neural network may be given unsupervised pre-training on a dataset of unlabeled photos in order to learn latent representations of different kinds of pills and their defects, hence reducing the amount of labelled data needed to learn. One range of solutions involves comparing an image of a suspicious pill to visual databases of pills and identifying potential substitutions that may have occurred in the supply chain. Another range would include assessments of the state of the medication (e.g. color and cloudiness of a liquid medication). As a deep learning methodology designed for two-dimensional image data and requires little initial pre-processing, CNN is well-suited for this purpose. 
     Classifier Inputs and Outputs 
     An exemplary deep neural network implementation selects an appropriate classification of the illegitimate product or product with a high risk of illegitimacy using a set of inputs to the neural network. Inputs whether structured or unstructured data type data points, can be encoded into fields of a vector (or tensor) representation. Implementations will employ various levels of abstraction in configuring, classification and anomaly detection tasks, e.g., in a pharmaceutical application, data can be selected to describe pharmaceutical manufacturing lots, shipment lots, nodes in a distribution network, entities, geographies and so forth. In one example, a neural network ensemble can implement a classifiers that are trained to classify situation states according to input data useful in regulatory compliance reporting, such as without limitation: A type of report (e.g., initial notification, follow-up notification, or request for termination), an incident number (provided by FDA) for follow-up and request for termination, a date of initial notification to FDA (MM/DD/YYYY), a date company determined product was illegitimate (MM/DD/YYYY), a name of product as it appears on the label, primary ingredients, drug use (human, other), a drug description (e.g., finished prescription drug, vaccine, plasma derivative (e.g., coagulation factors, immunoglobulins, albumin), allergenic (e.g., standardized and non-standardized), or multiple), a strength of drug (e.g., 500 mg. 1 g/10 mL), a dosage form (e.g., tablet, capsule, aerosol, oral liquid, sublingual, injectable, topical, suppository, other, or multiple), a quantity of drug (Number and Unit), an NDC (Nat&#39;l Drug Code) number, a serial number, lot number(s),expiration date(s), (for notification) a description of event/issue, (for request for termination of notification) description of why notification is no longer necessary, other reports submitted to the FDA (e.g., FAR—Field Alert Report, BPDR—Biological Product Deviation Report, Medwatch 3500, Medwatch 3500A, none, other), company name and address, company category, manufacturer, wholesale distributer, dispenser (Pharmacy), repackager, Unique Facility Number (D-U-N-S), and contact information. 
     The classifier(s) once trained on a training dataset can determine a Classification of Notification (Counterfeit, Diverted, Stolen, Intentional adulteration, Unfit for distribution, Fraudulent transaction) for a particular situation state. The exemplary deep neural network implementation selects an appropriate classification of the illegitimate product or product with a high risk of illegitimacy from a set of outputs. 
     
       
         
           
               
               
             
               
                   
               
               
                 Output 
                 Determined Conditions 
               
               
                   
               
             
            
               
                 Counterfeit 
                 A product is determined to be counterfeit, or has 
               
               
                   
                 a high risk of being counterfeit. 
               
               
                 Diverted 
                 A product is determined to be a diverted product, 
               
               
                   
                 or has a high risk of being a diverted product. 
               
               
                 Stolen 
                 A product is determined to be a stolen product, or 
               
               
                   
                 has a high risk of being a stolen product. 
               
               
                 Intentional  
                 A product is determined to be intentionally 
               
               
                 adulteration 
                 adulterated such that use of the product would 
               
               
                   
                 result in serious adverse health consequences or 
               
               
                   
                 death to humans, or has a high risk of it. 
               
               
                 Unfit for  
                 A product appears otherwise unfit for distribution 
               
               
                 distribution 
                 such that use of the product would be reasonably 
               
               
                   
                 likely to result in serious adverse health 
               
               
                   
                 consequences or death to humans, or has a high 
               
               
                   
                 risk of it. 
               
               
                 Fraudulent  
                 A product in your possession or control is 
               
               
                 transaction 
                 determined to be the subject of a fraudulent 
               
               
                   
                 transaction, or has a high risk of it. 
               
               
                   
               
            
           
         
       
     
     In one exemplary implementation, some neural networks implementing learning model(s)  134  are implemented as an ensemble of subnetworks trained using datasets widely chosen from approved transactions and flagged transactions, with outputs including classifications of anomalies based upon the input sensed data, and/or remedial actions to be triggered by invoking downstream applications such as preparing and submitting reports to blockchain implemented regulatory compliance information, as well as the capability to both cluster information and to escalate problems. 
     Having described neural network implementations, the discussion now turns to deep learning approaches. 
       FIG. 3C  illustrates a deep learning system in a supervised or semi-supervised implementation. As shown, deep learning system  300 C includes training servers  302  and production servers  304 . Large scale training dataset  312  is accessible to training servers  302  for training the deep convolutional neural network  334 . In an implementation, deep neural network  334  includes a first anomaly subnetwork, and a second solution accessibility subnetwork that are trained on one or more training servers  302 . The trained deep neural network ensemble including the first trained anomaly subnetwork, and the trained second solution accessibility subnetwork are deployed on one or more production servers  304  that receive input anomaly information from requesting client devices  122 . The production servers  304  process the input anomaly information through at least one of the deep neural network  334 , the first anomaly subnetwork, and the second solution accessibility subnetwork to produce outputs that are transmitted to the client devices  122 . 
     Training servers  302  conduct training using models and comprise a situation dataset generator  322  includes a deep convolutional neural network based variant anomaly classifier, running on numerous processors coupled to memory that prepares training sets comprising data chosen from large scale training dataset  312  to reflect one or more scenarios being trained, a variant anomaly classifier  332  includes a deep convolutional neural network based variant anomaly classifier, running on numerous processors coupled to memory that is trained to recognize anomalous situations from sensed data using the scenarios prepared, an optional secondary classifier  342  includes a deep convolutional neural network based secondary anomaly classifier, running on numerous processors coupled to memory that is trained to recognize special situation anomalies (e.g., radioactive spill, biohazard, etc.), a solution accessibility classifier  352  includes a deep convolutional neural network based secondary anomaly classifier, running on numerous processors coupled to memory that is trained to recognize anomalies and output identifiers identifying remedial applications that are invoked to trigger remedial actions. A semi-autonomous learner  362  includes a deep convolutional neural network based variant anomaly classifier, running on numerous processors coupled to memory that progressively augments a set size of the anomaly training set based on the trained ensemble&#39;s evaluation of a synthetic set or in implementations, input of live data from a real world scenario. 
     In one implementation, the neural networks such as situation dataset generator, variant anomaly classifier, secondary anomaly classifier, solution accessibility classifier, and semi-autonomous learner are communicably linked to the storage subsystem comprised of test data database  373 , production data database  374 , inferred data database  375  and other private data database  376  and user interface input devices. 
     In one implementation, data used in one or more of large scale training dataset  312 , test data database  373 , production data database  374 , inferred data database  375  and other private data database  376  is selectively obtained from multiple sources of data: (i) various drug databases (e.g., the FDA Product-Specific Guidance database, which enables searching and clustering by active ingredient(s)) and communications including machine reading of emails on recalls minimizes the need to change notification protocols that can be related to machine- readable data and image recognition (e.g. images of pills) and (ii) user responses to deep learning driven follow-up questions selected by the solution accessibility classifier  352  and semi-autonomous learner  362  (allowing for live training and refinement). 
     Other implementations may include a non-transitory computer readable storage medium storing instructions executable by a processor to perform actions of the system described above. Yet another implementation may include a method performing actions of the system described above. 
     Having described deep learning approaches, the discussion now turns to smart contract implementations. 
     Blockchain-Based Chain Code/Smart Contract 
       FIG. 4A  is a flow diagram  400 A depicting an example permissioned blockchain transactions that can be used to implement the technology disclosed. In permissioned blockchain implementations, chain code can be installed onto peer server(s)  136  by interface server(s)  102  using a multiple-phase process. 
     In an install chain code process (flows  401 - 407 ) the source code is uploaded to the peer server(s)  136 . There is no effect on the blockchain ledger here. This process is typically initiated via a peer administrator, an automaton identity which has admin privileges on the peer, including privileges to install chain code (i.e., upload source code of the chain code). In a flow  401 , a request from the peer admin to install a chain code is received by an interface server(s)  102 . Then, in a flow  403 , the interface server(s)  102  makes a request to install chain code on the peer server(s)  136 . The peer server(s)  136  perform the requested chain code install and reply in a flow  405  with a response indicating the operation was successful (or a failure). In a flow  407 , the particular one of the interface server(s)  102  passes the response to the peer administrator that made the install request. 
     In an instantiate chain code process (flows  409 - 425 ) causes the chain code installed previously to be compiled and executed, typically placed in a ready state waiting for transaction requests. This takes the form of a formal transaction conducted upon the blockchain ledger; and it is subject to the same flow and rules. This process is typically initiated via a channel administrator, an automaton identity which has admin privileges on the channel (here, “channel” is another term for the blockchain), including privileges to instantiate chain code (instantiate or upgrade what chain code is running on the channel). In a flow  409 , a request from the channel admin to instantiate a chain code is received by an interface server(s)  102 . Then, in a flow  411 , the interface server(s)  102  makes a chain code transaction proposal to instantiate chain code installed on the peer server(s)  136 . The peer server(s)  136  perform instantiating the requested chain code and reply in a flow  413  with a response indicating the operation was successful (or a failure). The interface server(s)  102  makes a request to broadcast the instantiate chain code transaction in a flow  415 , which is received by fabric orderer  155 . The fabric orderer  155 , which executes on a server other than the interface server(s)  102 , orders the transaction and adds it to the blockchain ledger and replies in a flow  417  with a response indicating whether the operation was successful (or a failure). In a flow  419 , if the broadcast failed, the particular one of the interface server(s)  102  passes the response to the channel administrator that made the install request. In a flow  421 , the fabric orderer  155  sends a transaction commit result response to the peer server(s)  136 . Peer server(s)  136  then send a transaction commit result response in flow  423  to the particular one of the interface server(s)  102  that initiated the instantiate chain code transaction in flow  411 . The particular one of the interface server(s)  102  in flow  425  sends a response transaction commit result indicating the operation was successful (or a failure) to the channel administrator to indicate the outcome of the requested adding the transaction to the blockchain ledger. 
     In a blockchain access process, such as when a user at client device  122  wants to issue an electronic transaction that affects the blockchain ledger, the structure of this workflow is identical to that of the instantiate chain code process workflow described above with reference to flows  409 - 425  (since instantiate is just a particular kind of transaction). 
       FIG. 4B  is a flow diagram  400 B depicting an example publicly accessible blockchain transactions that can be used to implement the technology disclosed. DApp  136  is used to store the anomaly reports in the tamper-proof blockchain network  106 . DApp  136  is decentralized in nature, with no single entity or organization controlling the infrastructure on which the applications are deployed. In the context of Ethereum™, DApp  136  is backed by smart contracts  402  which are deployed on the Ethereum™ blockchain platform that is maintained by the Ethereum™ nodes or peers worldwide. Even though DApp  136  is deployed on a central server which is either a full Ethereum™ node or a can communicate with an Ethereum™ node, the server only serves the DApp&#39;s web interface. The DApp logic is controlled by the associated smart contracts  402  which are deployed on the blockchain network  106 . DApp  136  provides a friendly interface to smart contracts  402  where the client devices  122  can submit transactions to the contracts from a web interface based on frontend HTML  412 , frontend JavaScript (JS)  422 , and other files  432  like stylesheets and images. A DApp&#39;s web interface forwards the transactions to the blockchain platform and displays the transaction receipts or state information in the smart contracts  402  in the web interface. DApp  136  can use a decentralized messaging protocol such as Whisper™ for communication and decentralized storage platforms such as Swarm™ for static storage. 
     In example  400 B, DApp  136  sends a smart contract to the blockchain node  404  for compilation. Blockchain node  404  comprises a compiler  414  and a blockchain client  424 . Compiler  414  can compile smart contracts written in various high-level languages such as Solidity™, Serpent™, and Lisp™. Blockchain client  424  communicates with the blockchain network  106  and performs tasks such as creating accounts and contracts, sending transactions to contracts, and others. Examples of blockchain client devices  424  include geth (written in Go™) and pyethapp (written in Python™). 
     In response, the blockchain node  404  sends the contract binary to DApp  136 . This allows DApp  136  to deploy the contract on the blockchain node  404 . Once the contract is deployed, the blockchain node  404  sends a contract address and an application binary interface (ABI) to DApp  136 . ABI provides an interface to the state variables and functions defined in the deployed contract. After this, DApp  136  sends transactions to the deployed contract. 
       FIG. 5  illustrates an example storage block  500  of a blockchain network  106  that implements the technology disclosed. Storage block(s)  500  identifies two related versions of an FDA 3911 report: version 1 is the initial notification and version 2 is the follow-up notification. For each version, the storage block(s)  500  identifies an incident number assigned to the anomaly. In implementations, data too sensitive to risk being stored directly on the blocks of the blockchain network  106  can be stored by Private storage server(s)  156  that access private collections data stored for each organization, which may comprise information of various drug databases (e.g., the FDA Product-Specific Guidance database, which enables searching and clustering by active ingredient(s)) and communications including machine reading of emails on recalls. Interface server(s)  102  is cooperatively coupled with, and permissively enabled to access the private collections stored by private storage server(s)  156  that can comprise multiple sources of data stored by individual organizations that are members of the blockchain network  106 , thereby minimizing the need to change notification protocols that can be related to machine-readable data and image recognition (e.g. images of pills). 
     For example, medical privacy laws such as health insurance portability and accountability act (HIPAA), general data protection regulation (GDPR), and others, legal, regulatory or private, place restrictions on the usage and keeping of data. In such cases, information can be stored locally by participants in the blockchain network  106  in private storage server(s)  156 . Addressing information can be pushed by the custodian of the locally stored data, typically in encrypted or other non-human readable form to provide protection from tampering by a single actor and provides for data confidentiality with encryption at the block level. 
     The storage block(s)  500  can also include hashed addressing information for private storage server(s)  156  that control copies of the potentially private information of other fields of the FDA 3911 form, such as a date of initial notification, name of the product, primary ingredients, etc. that are too sensitive to be included in bock(s)  500 ; thereby enabling the interface server(s)  102  to obtain this information when permitted and safeguarding this information from public release. 
     For example, data useful in regulatory compliance reporting stored by private storage server(s)  156  and pointed on by storage block(s)  500 , can include without limitation: A type of report (e.g., initial notification, follow-up notification, or request for termination), an incident number (provided by FDA) for follow-up and request for termination, a date of initial notification to FDA (MM/DD/YYYY), a date company determined product was illegitimate (MM/DD/YYYY), a name of product as it appears on the label, primary ingredients, drug use (human, other), a drug description (e.g., finished prescription drug, vaccine, plasma derivative (e.g., coagulation factors, immunoglobulins, albumin), allergenic (e.g., standardized and non-standardized), or multiple), a strength of drug (e.g., 500 mg. 1 g/10 mL), a dosage form (e.g., tablet, capsule, aerosol, oral liquid, sublingual, injectable, topical, suppository, other, or multiple), a quantity of drug (Number and Unit), an NDC (Nat&#39;l Drug Code) number, a serial number, lot number(s),expiration date(s), (for notification) a description of event/issue, (for request for termination of notification) description of why notification is no longer necessary, other reports submitted to the FDA (e.g., FAR—Field Alert Report, BPDR—Biological Product Deviation Report, Medwatch 3500, Medwatch 3500A, none, other), company name and address, company category, manufacturer, wholesale distributer, dispenser (Pharmacy), repackager, Unique Facility Number (D-U-N-S), and contact information. 
     Ouput(s) of classifier(s) once trained on a training dataset can also be stored by private storage server(s)  156  and pointed on by storage block(s)  500 , can include without limitation: a classification of notification (e.g., counterfeit, diverted, stolen, intentional adulteration, unfit for distribution, fraudulent transaction, others) for a particular situation state. 
       FIG. 6A  illustrates an example workflow  600 A in which a smart contract  604 A implements the technology disclosed. Workflow  600 A illustrates a contract owner  602 A creates the smart contract  604 A called “Drug Notifications” (e.g., “contract Validator”) via an externally owned account (EOA). EOA has a public-private key pair associated with it. The account address (e.g., “address public chairperson”) is derived from the public key. When a new EOA is created, a JSON key file is created which has the public and private keys associated with the account. The private key is encrypted with the password which is provided while creating the account. For sending transactions to other accounts, the private key and the account password are required. The contract account is controlled by the associated contract code which is stored with the account. The contract code execution is triggered by transactions sent by the EOA. In some implementations, smart contract  604 A can be created by interface servers(s)  102 . 
     Transactions are the electronic messages sent by EOAs to other EOAs or contract accounts. Each transaction includes the address of the recipient, transaction data payload, and a transaction value. When a transaction is sent to an EOA, the transaction value is transferred to the recipient. When a transaction is sent to a contract account, the transaction data payload is used to provide input to the contract function to be executed. 
     Smart contract  604 A is used to store and validate the drug notification reports. Smart contract  604 A includes state variables (e.g., “struct Incident”, “struct Drug”, “Drug[] public drugs”) that can store and identify different versions of a reporting file. In addition, smart contract  604 A also includes state variables (e.g., “struct Assessor”, “struct Incident”) that can store and identify data origin validation of given version by one or more validators. 
     Smart contract  604 A also includes functions (e.g., “createIncidentReport”) that can be used by client devices  122  and interface server(s)  102  to send the FDA forms 3911 to the smart contract  604 A and in turn to the blockchain network  106 . In implementations, a single function can be used to send FDA forms 3911 for the entire reporting file or separate functions can be used for individual reporting instances of the reporting file. Similarly, smart contract  604 A includes functions (e.g., “getIncidentReports”) that can be used by client devices 122 and interface server(s)  102  to get the FDA 3911 reports stored on the blockchain network  106 . Smart contract  604 A also includes functions (e.g., “wasReportValidatedBy”) that allow client devices  122  and interface server(s)  102  to validate a report stored on the blockchain network  106 . Smart contract  604 A also includes functions (e.g., “Validator”) that allow client devices  122  and interface server(s)  102  to identify themselves by sending their account addresses to the smart contract  604 A. 
       FIG. 6B  illustrates another example workflow  600 B in which a smart contract  604 B implements the technology disclosed. Workflow  600 B illustrates a contract owner  602 B creates the smart contract  604 B called “Clinical Trials” (e.g., “contract Validator”) via an externally owned account (EOA). EOA has a public-private key pair associated with it. The account address (e.g., “address public chairperson”) is derived from the public key. When a new EOA is created, a JSON key file is created which has the public and private keys associated with the account. The private key is encrypted with the password which is provided while creating the account. For sending transactions to other accounts, the private key and the account password are required. The contract account is controlled by the associated contract code which is stored with the account. The contract code execution is triggered by transactions sent by the EOA. In some implementations, smart contract  604 B can be created by interface server(s)  102 . 
     Transactions are the electronic messages sent by EOAs to other EOAs or contract accounts. Each transaction includes the address of the recipient, transaction data payload, and a transaction value. When a transaction is sent to an EOA, the transaction value is transferred to the recipient. When a transaction is sent to a contract account, the transaction data payload is used to provide input to the contract function to be executed. 
     Smart contract  604 B is used to store and validate the clinical trial reports. Smart contract  604 B includes state variables (e.g., “struct Study”, “struct Trial”, “Trial[] public trials”) that can store and identify different versions of a reporting file. In addition, smart contract  604 B also includes state variables (e.g., “struct Assessor”, “struct Study”) that can store and identify data origin validation of given version by one or more validators. 
     Smart contract  604 B also includes functions (e.g., “createTrialReport”) that can be used by client devices  122  and interface server(s)  102  to send clinical trial reports to the smart contract  604 B and in turn to the blockchain network  106 . In implementations, a single function can be used to send clinical trial reports for the entire study recording file or separate functions can be used for individual reporting instances of the study recording file. Similarly, smart contract  604 B includes functions (e.g., “getTrialReports”) that can be used by client devices  122  and interface server(s)  102  to get the clinical trial reports stored on the blockchain network  106 . Smart contract  604 A also includes functions (e.g., “wasReportValidatedBy”) that allow client devices  122  and interface server(s)  102  to validate a report stored on the blockchain network  106 . Smart contract  604 A also includes functions (e.g., “Validator”) that allow client devices  122  and interface server(s)  102  to identify themselves by sending their account addresses to the smart contract  604 B. 
     As time-stamped immutable data structures, blockchains have found utility in cryptocurrency. Unlike a relational database, blockchain network  106  enables implementations to protect data from tampering by a single actor, and/or to provide data confidentiality with encryption at the block level. For additional information on the user of blockchains, reference may be had to US. Application 15-345,031, entitled Extended Blockchains for Event Tracking and Management, filed Nov. 7, 2016, and US. Application 15-454,492, entitled Extended Blockchains for Event Tracking and Management, filed Aug. 29, 2016, which applications are incorporated herein in their entirety by reference for all purposes. 
     Having described smart contract-based implementation of the technology disclosed, the discussion now turns to the interface server(s). 
     Interface Servers 
     In one implementation, the interface server(s)  102  are provisioned as clients to the blockchain system  106 , provisioned as production server(s)  304 , enabling their function to be safe from prying eyes. The challenge for permissioned blockchains within regulated communities is to create a robust community that meets regulatory obligations in near-real-time without simultaneously creating a single point of failure or back-door. Once a single point of failure is created, the blockchain for all intents and purposes becomes a centralized database, whether the architecture is decentralized. Implementation specifics differ; depending on the nature of a particular installation&#39;s user and regulatory requirements, the interface server(s)  102  can be configured in different configurations, outlined below. 
     In an implementation, configurations are based on the relationships between users (e.g. omniscient regulator, board of governors, or root of trust) and the degree of access required for the interface server(s)  102  to be effective (omniscient agent, constrained community-wide agent, or constrained and transparent task-specific agent). The interface server(s)  102  are restricted to only log into the block chain system as a user. Privacy can be enhanced by restricting the interface server(s) database access on the level of a traditional database administrator. As an automaton user, the interface server(s) require no human-readable interface (UX/UI); rather can create notifications to relevant client devices  122  and conducts block-level transactions with blockchain network  106 . 
     In one alternative example, if an interface server implementation only requires publicly accessible data to perform a function (as in the case of Form 3911 outlined below), the core of the interface server(s) logic can be implemented as smart contracts within the blockchain system  106 . Such smart contracts, by definition, are auditable by every community member, and provide fine-grained control over what data is ultimately shared with what parties. This control can be ensured through leveraging a combination of data privacy features unique to permissioned blockchains. For instance, building on Hyperledger Fabric, the interface server logic would be implemented as separate chain code, responsible for flagging anomalous transactions or alerting on suspicious correlations. It would be straightforward for an interested party to verify that this chain code cannot be used by any party to query data at-will, and that the notifications are output only to relevant community members. Further control can be exercised by deploying the chain code on separate channels, which allows restricting information sharing between subsets of system participants. 
     In another alternative example, if an interface server implementation additionally procures private data that does not exist on the blockchain (e.g. from a particular organizations&#39; private storage server(s)  156 , then the private source being accessed by the interface server(s)  102  would need to be trusted by all other participants on the blockchain. Though interface server(s)  102  wouldn&#39;t necessarily have access to all of an organization&#39;s private data, it would be granted access to the requisite set of data needed to function. This could take the form of viewing private collection files to which a given organization granted it access (given rules such as “send interface server all user-submitted images of suspected faulty pill bottles”), or by having more global access to private collections. 
     As mentioned previously, the first approach would be suitable in the case of the FDA DSCSA. Form FDA 3911 submissions are used by the system users to generate exception reports for suspicious drugs. Each of the fields from the 3911 could be held on the blockchain as a separate variable. Interface server(s) flag any identical entries in any fields (e.g. two matches may be adequate for a notification involving a controlled substance, perhaps three for a less dangerous medicine) for further escalation in a smart manner. For example, if a Walgreens dispenser in Chicago says that Oxycontin lot #5667777 looks wrong and CVS in Woonsocket reports a problem with the same lot, the escalation by the interface server(s)  102  might trigger them sending a fresh notification to the manufacturer and FDA, indicating that this lot has multiple reporters reporting a problem. Under the current Form 3911 system, the manufacturer and FDA would receive two different notifications from two different reporters and have to collate them manually off-line. 
     In an implementation, the interface server(s)  102  accesses smart contracts that can invoke follow-up notifications to the reporting entity or entities. The submitting or reporting entity might be asked to take a picture of the goods in question, or confirm their whereabouts, or ask to describe symptoms. They might also be asked to quarantine suspicious materials, or mail them to the CDC, or hold for pickup by the DEA. 
     With a notification from participating interface server(s), the FDA can then post a Medwatch notification or call the manufacturer and ask for clarification. Alternatively, a manufacturer might proactively ask for quarantine. For especially sensitive products such as fentanyl, the system could quarantine all transactions for that lot for 24 hours while humans at the manufacturer and FDA discuss their options. 
     This implementation is part of a broader initiative to develop a system of blockchain- validated reporting, resolution and root cause analysis. The implementations illustrated by FIGS.  7 A,  7 B implement tracking and responding in near-real-time to out-of-spec asset reports in critically important supply scenarios and managing access to clinical trial information, respectively. 
     Having described smart contract-based implementation of the technology disclosed, the discussion now turns to some example use cases. 
     Example Use Case 
       FIG. 7A  depicts an example use case  700 A in which the smart contract  604 A of  FIG. 6A  is used to securely authenticate an incident reporting file from initial collection through resolution. The technology disclosed provides a way to securely authenticate an incident reporting file from initial collection through post-resolution. Consider that a first actor affiliated with a regulatory enforcement agency for example, uses a client device  122  to create a smart contract  604 A on the blockchain network  106  with a policy goal of ensuring data integrity and creating a provenance trail of evidentiary data collection of an incident event. If a seal is broken on a pill bottle, for example, a dispenser (pharmacy) is required to categorize and report the problem via an FDA form 3911 within 24 hours. The initial incident report can be prepared and submitted by one of client devices  122 , authorized to submit such reports on behalf of the dispenser (or warehouse encountering a damaged shipment, etc.) using their device to invoke the interface server  102 . In the case of the FDA DSCSA, FDA form 3911 submissions are used by the system users to generate exception reports for suspicious drugs. Each of the fields from the 3911 can be held on the blockchain as a separate variable. Interface server  102  flags any identical entries in any fields (e.g. two matches may be adequate for a notification involving a controlled substance, perhaps three for a less dangerous medicine) for further escalation. 
     To persist and authenticate the origin of the report, a first custodian (e.g., user A) using the guided screens driven by deep neural network(s)  334  can collect and input information into the application required to prepare FDA form 3911 and upload the report to smart contract  604 A. These inputs can be stored on the blockchain network  106  as a report of the incident along with the credentials of user A. 
     Accordingly, when another user B, such as a pharmacy in a neighboring county, receives a local copy of the report from the regulatory enforcement agency, to ensure that the original information has not been tampered with, user B can generate for the local copy of the report and compare it with those stored on the blockchain network  106  as report 1. This may require the regulatory enforcement agency giving user B access to smart contract, in addition to the report (which can be provided separately). For example, if a Walgreens dispenser in Chicago reports that Oxycontin lot #5667777 looks wrong, a CVS in Woonsocket (user B) compares their local copy and the blockchain version. User B can determine the veracity of the local copy. If local copy is unaltered, user B can validate report 1 and store the validation on the blockchain network  106  appended to report 1 so that other users can see that report 1 has been validated by another user. 
     It is often the case that exceptions affecting one shipment will also affect other shipments in the lot. User B examines their stock for similar discrepancies. User B upon investigation discovers a problem with the same lot, user B can generate a report for any exceptions that they find in their stock and commit the report to the blockchain network  106  as a second report. Detecting identical problems causes interface server  102  of user B to escalate the problem, triggering a notification to the manufacturer and FDA, indicating that this lot has multiple reporters reporting a problem. 
     This may motivate another user C, such as a manufacturer, to compare the report 1 and report 2, verify the chain of custody all the way back to the point of origin, and validate that report 2 is related to the same problem as report 1. In implementations, prior versions of a current version can be stored. This way, a provenance trail of the chain of custody can be stored and presented using smart contract  604 A . 
     One implementation includes a mobile application that executes as a client on one or more client device(s)  122 , displaying panels as triggered by the interface server(s)  102  when backed by a blockchain network  106 , captures barcodes on questionable package and video, audio or other sensed information. A representative usage scenario of a mobile application is next described with reference to  FIGS. 8A-8H . 
       FIGS. 8A-8H  depict an example use case  800 . In  FIG. 8A , an example  800 A depicts a series of prompts displayed to a user in a representative usage scenario. In  FIG. 8B , an example screen  800 B is shown. Screen  800 B displays a QR code  802 B that the client device  122  has displayed along with a scan prompt  804 B, enabling the user to capture the QR code by depressing the prompt  804 B. Client device  122  captures the QR Code and sends the QR code to the interface server(s)  102  via network(s)  101 . The interface server(s)  102  will retrieve information from private storage server(s)  156  and sends this information to the client device  122  via the network(s)  101 . 
     In  FIG. 8C , screen  800 C displays the information  802 C sent to client devices  122 . Screen  800 C also displays a plurality of prompts to solicit from the user an input triggering a course of action, including a write report prompt  804 C, a use voice recognition prompt  806 C, a prompt  808 C to change user languages and a cancel prompt  810 C. Not all prompts will be displayed in every implementation. Further, some implementations will include other additional prompts facilitating different actions. 
     Now with reference to  FIG. 8D , screen  800 D is displayed by client device  122 . Interface server(s)  102  has triggered client device  122  to display an input area  802 D prompting the user to enter a description of an issue or problem. Screen  800 D further includes a submit prompt  804 D and a cancel prompt  806 D. When a user enters their problem description into the input area  802 D and selects the submit prompt  804 D, client device  122  sends the information to the interface server(s)  102 . The interface server(s)  102  analyzes the input text into vector representations and inputs these into one or more of the learning models(s)  134 . Learning model(s)  134 , such as a deep neural network(s)  334  provide an output result based upon statistically learned results. The interface server(s)  102  using the result triggers an application to implement a course of action selected by the learning model(s)  134  as having a greater than threshold probability to remediate the problem encountered. The course of action can include one or more of prompting the client device  122  for additional details, or inputs such as capturing a photograph, voice input, etc., directions to the user such as how to dispose of or return a bad lot, and/or formulate a report to a regulatory agency. One example of one type of follow up prompting triggered by interface server(s)  102  is illustrated by  FIG. 8E , depicting a screen  800 E including a voice input prompt  802 E that prompts the user to press a prompt  804 E and describe the issue. A cancel prompt  806 E is also provided. 
       FIG. 8F  depicts screen  800 F illustrating an example of another type of follow-up prompting triggered based upon output of learning model(s)  134 . In the scenario illustrated by  FIG. 8F , the user has entered a nebulous input “my pills look weird” in input box  802 F. Client device  122  passed this nebulous input to the interface server(s)  102 , which analyzed the nebulous input and submitted it as input to one or more of the learning model(s)  134 . Learning model(s)  134 , such as a deep neural network(s)  334  provide an output result based upon statistically learned results provided as output a set  804 F of follow-up prompts. Follow up prompt  804 F prompts the user to “pick one of the following” from a set of potential inputs. The set of potential inputs selected by the learning model(s)  134  as having a greater than threshold probability to remediate the problem encountered include “pills are damaged”  806 F, “pills are the wrong color”&#39;  808 F, “pills are the wrong size”  810 F and “none of the above”  812 F. Also displayed is an option for the user to cancel  814 F. 
     Now with reference to  FIG. 8G , continuing with the scenario described with reference to  FIG. 8F , the user has selected option “pills are the wrong color”  808 F. The interface server(s)  102  respond with a further follow-up prompt  802 G that urges the user to use the camera of client device  122  to take a picture of one of your pills and provides a camera trigger prompt  804 G. Alternatively, or in addition, follow up screen  800 H of  FIG. 8H  can be triggered. Screen  800 H includes a picture  802 H of the product corresponding to the QR code input in screen  800 B, which the interface server(s)  102  have retrieved from private storage server(s)  156 . Screen  800 H further includes a follow up prompt  804 H that asks the user specifically about the picture  802 H and the product that the user of client device  122  is working with. The user&#39;s response will be sent to the interface server(s)  102  and again submitted to the learning model(s)  134  to trigger a remedial action if appropriate. 
       FIG. 81  illustrates a system console screen  800 I in an implementation. Screen  800 I depicts a plurality of chain code known to the blockchain network  106 . Processes executing with administrative privileges can install and/or instantiate these chain codes in various peer server(s)  136  using the process flows described herein above with reference to  FIG. 4A . 
       FIG. 7B  depicts an example use case  700 B in which the smart contract  604 B of  FIG. 6B  is used to securely authenticate a clinical study recording file from initiating the study to collection of trial data throughout the study to completion. The technology disclosed provides a way to securely authenticate a clinical study recording file from initiation through post-completion. Consider that a first actor, contract owner  602 B uses a client device  122  to create smart contract  604 B on the blockchain network  106 . The first actor can be affiliated with a clinical lab, hospital, research institution, or governmental or non-governmental agency with a policy goal of ensuring data integrity and creating a provenance trail of evidentiary data collection of trials conducted in furtherance of the clinical study. Subsequently, an initial trial report can be prepared and submitted using one of client devices  122 , that has been authorized to submit such reports on behalf of the clinic (or research lab, hospital, etc.) using their device to invoke an instance of interface server  102 . Trial report submissions are used by the system users A, B, C, etc. to generate records for trials being conducted in furtherance of the study. Each of the fields from the study record can be held on the blockchain as a separate variable. Interface server(s)  102  flags any identical entries in any fields (e.g. two matches may be adequate for trial IDs in recordings of trials, perhaps three for variables in which some duplicity is expected). 
     To persist and authenticate the origin of the record, a first custodian (e.g., user A) using the guided screens driven by learning model(s)  134  can collect and input information into the application required to prepare and upload the record of a particular trial to smart contract  604 B corresponding to a particular study. These inputs can be stored on the blockchain network  106  as a report of the trial along with the credentials of user A. 
     When another user B, such as a scientist conducting a clinical trial, receives a local copy of the report from user A of trial 1, to ensure that the original information has not been tampered with, user B can generate an encrypted version for the local copy of the report and compare it with those stored on the blockchain network  106  as report of trial 1. An interface server(s)  102  invokes contract validator  604 B to determine whether user B has been granted permission to view the report 1 including patient related data portions. Permission may have been given by the research lab, governmental agency or non-governmental agency that acts as contract owner  602 B of the study. This can require the contract owner  602 B giving user B access to smart contract  604 B, in addition to the report (which can be provided separately). For example, if report 1 includes patient related data, the interface server(s)  102  compares the role of user B with the access permissions required to view the report 1, by determining whether the request is made by a participant in a clinical trial or a scientist conducting a clinical trial. Interface server(s)  102  then permits access to the participant of a subset of the clinical trial information suitable for the participant, otherwise permitting access to the scientist of a different subset of the clinical trial information suitable for the scientist. User B, being a scientist in this case, encrypts their local copy and compares it to the blockchain version, enabling user B can determine the veracity of the local copy. If local copy is unaltered, user B can validate report 1 and store the validation on the blockchain network  106  appended to report 1 so that other users can see that report 1 has been validated by another user. On the other hand, if user B were a study participant, rather than a scientist, interface server(s)  102  would permit user B access only to portions of the block-level data in the report 1 suitable to a participant in the trial. 
     Another user C, such as a scientist in a different facility that is also conducting trials, might download report 1 and compare the original version of report 1 with the version of report 1 with validation appended to it by user B, verifying the chain of custody all the way back to the point of origin, and validating that report 1 version 2 is related to the same trial as report 1, original version. In implementations, prior versions of a current version can be stored. This way, a provenance trail of the chain of custody can be stored and presented using smart contract  604 B. 
     Another scientist, user D, requests to add a patient to a trial in the study using their client device  122  locates a block on the chain in which some patient data of the request relates. The interface server(s)  102  using smart contract  604 B determines whether the request is authorized under a smart contract governing the use of the clinical trial blockchain; and adds the patient to the clinical trial whenever the request is authorized. 
     Computer System 
       FIG. 9  illustrates one implementation of a computer system  900  that can be used to implement the technology disclosed. Computer system  900  includes at least one central processing unit (CPU)  972  that communicates with a number of peripheral devices via bus subsystem  955 . These peripheral devices can include a storage subsystem  910  including, for example, memory devices and a file storage subsystem  936 , user interface input devices  938 , user interface output devices  976 , and a network interface subsystem  974 . The input and output devices allow user interaction with computer system  900 . Network interface subsystem  974  provides an interface to outside networks, including an interface to corresponding interface devices in other computer systems. The analyzer and deep learning system can be communicably linked to the storage subsystem  910  and the user interface input devices  938 . 
     User interface input devices  938  can include a keyboard; pointing devices such as a mouse, trackball, touchpad, or graphics tablet; a scanner; a touch screen incorporated into the display; audio input devices such as voice recognition systems and microphones; and other types of input devices. In general, use of the term “input device” is intended to include all possible types of devices and ways to input information into computer system  900 . 
     User interface output devices  976  can include a display subsystem, a printer, a fax machine, or non-visual displays such as audio output devices. The display subsystem can include an LED display, a cathode ray tube (CRT), a flat-panel device such as a liquid crystal display (LCD), a projection device, or some other mechanism for creating a visible image. The display subsystem can also provide a non-visual display such as audio output devices. In general, use of the term “output device” is intended to include all possible types of devices and ways to output information from computer system  900  to the user or to another machine or computer system. 
     Storage subsystem  910  stores programming and data constructs that provide the functionality of some or all of the modules and methods described herein. These software modules are generally executed by deep learning processors  978 . 
     Deep learning processors  978  can be graphics processing units (GPUs) or field-programmable gate arrays (FPGAs). Deep learning processors  978  can be hosted by a deep learning cloud platform such as Google Cloud Platform™, Xilinx™, and Cirrascale™. Examples of deep learning processors  978  include Google&#39;s Tensor Processing Unit (TPU)™, rackmount solutions like GX4 Rackmount Series™, GX2 Rackmount Series™, NVIDIA DGX-1™ Microsoft&#39; Stratix V FPGA™, Graphcore&#39;s Intelligent Processor Unit (IPU)™, Qualcomm&#39;s Zeroth Platform™ with Snapdragon processors™, NVIDIA&#39;s Volta™, NVIDIA&#39;s DRIVE PX™ NVIDIA&#39;s JETSON TX1/TX2 MODULE™, Intel&#39;s Nirvana™, Movidius VPU™, Fujitsu DPI™, ARM&#39;s DynamiclQ™, IBM TrueNorth™, and others. 
     Memory subsystem  922  used in the storage subsystem  910  can include a number of memories including a main random access memory (RAM)  932  for storage of instructions and data during program execution and a read only memory (ROM)  934  in which fixed instructions are stored. A file storage subsystem  936  can provide persistent storage for program and data files, and can include a hard disk drive, a floppy disk drive along with associated removable media, a CD-ROM drive, an optical drive, or removable media cartridges. The modules implementing the functionality of certain implementations can be stored by file storage subsystem  936  in the storage subsystem  910 , or in other machines accessible by the processor. 
     Bus subsystem  955  provides a mechanism for letting the various components and subsystems of computer system  900  communicate with each other as intended. Although bus subsystem  955  is shown schematically as a single bus, alternative implementations of the bus subsystem can use multiple busses. 
     Computer system  900  itself can be of varying types including a personal computer, a portable computer, a workstation, a computer terminal, a network computer, a television, a mainframe, a server farm, a widely-distributed set of loosely networked computers, or any other data processing system or user device. Due to the ever-changing nature of computers and networks, the description of computer system  900  depicted in  FIG. 9  is intended only as a specific example for purposes of illustrating the preferred embodiments of the present invention. Many other configurations of computer system  900  are possible having more or less components than the computer system depicted in  FIG. 9 . 
     Convolutional Neural Networks 
     A convolutional neural network is a special type of neural network. The fundamental difference between a densely connected layer and a convolution layer is this: Dense layers learn global patterns in their input feature space, whereas convolution layers learn local patters: in the case of images, patterns found in small 2D windows of the inputs. This key characteristic gives convolutional neural networks two interesting properties: (1) the patterns they learn are translation invariant and (2) they can learn spatial hierarchies of patterns. 
     Regarding the first, after learning a certain pattern in the lower-right corner of a picture, a convolution layer can recognize it anywhere: for example, in the upper-left corner. A densely connected network would learn the pattern anew if it appeared at a new location. This makes convolutional neural networks data efficient because they need fewer training samples to learn representations they have generalization power. 
     Regarding the second, a first convolution layer can learn small local patterns such as edges, a second convolution layer will learn larger patterns made of the features of the first layers, and so on. This allows convolutional neural networks to efficiently learn increasingly complex and abstract visual concepts. 
     A convolutional neural network learns highly non-linear mappings by interconnecting layers of artificial neurons arranged in many different layers with activation functions that make the layers dependent. It includes one or more convolutional layers, interspersed with one or more sub-sampling layers and non-linear layers, which are typically followed by one or more fully connected layers. Each element of the convolutional neural network receives inputs from a set of features in the previous layer. The convolutional neural network learns concurrently because the neurons in the same feature map have identical weights. These local shared weights reduce the complexity of the network such that when multi-dimensional input data enters the network, the convolutional neural network avoids the complexity of data reconstruction in feature extraction and regression or classification process. 
     Convolutions operate over 3D tensors, called feature maps, with two spatial axes (height and width) as well as a depth axis (also called the channels axis). For an RGB image, the dimension of the depth axis is 3, because the image has three color channels; red, green, and blue. For a black-and-white picture, the depth is 1 (levels of gray). The convolution operation extracts patches from its input feature map and applies the same transformation to all of these patches, producing an output feature map. This output feature map is still a 3D tensor: it has a width and a height. Its depth can be arbitrary, because the output depth is a parameter of the layer, and the different channels in that depth axis no longer stand for specific colors as in RGB input; rather, they stand for filters. Filters encode specific aspects of the input data: at a height level, a single filter could encode the concept “presence of a face in the input,” for instance. 
     For example, the first convolution layer takes a feature map of size (28, 28, 1) and outputs a feature map of size (26, 26, 32): it computes 32 filters over its input. Each of these 32 output channels contains a 26×26 grid of values, which is a response map of the filter over the input, indicating the response of that filter pattern at different locations in the input. That is what the term feature map means: every dimension in the depth axis is a feature (or filter), and the 2D tensor output [:, :, n] is the 2D spatial map of the response of this filter over the input. 
     Convolutions are defined by two key parameters: (1) size of the patches extracted from the inputs—these are typically 1×1, 3×3 or 5×5 and (2) depth of the output feature map—the number of filters computed by the convolution. Often these start with a depth of 32, continue to a depth of 64, and terminate with a depth of 128 or 256. 
     A convolution works by sliding these windows of size 3×3 or 5×5 over the 3D input feature map, stopping at every location, and extracting the 3D patch of surrounding features (shape (window_height, window_width, input_depth)). Each such 3D patch is ten transformed (via a tensor product with the same learned weight matrix, called the convolution kernel) into a 1D vector of shape (output_depth,). All of these vectors are then spatially reassembled into a 3D output map of shape (height, width, output_depth). Every spatial location in the output feature map corresponds to the same location in the input feature map (for example, the lower-right corner of the output contains information about the lower-right corner of the input). For instance, with 3×3 windows, the vector output [i, j, :] comes from the 3D patch input [i−1: i+1, j−1J+1, :]. The full process is detailed in  FIG. 10 , illustrating an implementation of a convolutional neural network suitable for implementing the disclosed technology. 
     The convolutional neural network comprises convolution layers which perform the convolution operation between the input values and convolution filters (matrix of weights) that are learned over many gradient update iterations during the training. Let (m, n) be the filter size and W be the matrix of weights, then a convolution layer performs a convolution of the W with the input X by calculating the dot product W·x+b, where xis an instance of X and b is the bias. The step size by which the convolution filters slide across the input is called the stride, and the filter area (m×n) is called the receptive field. A same convolution filter is applied across different positions of the input, which reduces the number of weights learned. It also allows location invariant learning, i.e., if an important pattern exists in the input, the convolution filters learn it no matter where it is in the sequence. 
     Training a Convolutional Neural Network 
       FIG. 11  depicts a block diagram of training a convolutional neural network in accordance with one implementation of the technology disclosed. The convolutional neural network is adjusted or trained so that the input data leads to a specific output estimate. The convolutional neural network is adjusted using back propagation based on a comparison of the output estimate and the ground truth until the output estimate progressively matches or approaches the ground truth. 
     The convolutional neural network is trained by adjusting the weights between the neurons based on the difference between the ground truth and the actual output. This is mathematically described as: 
       Δ   i =x i δ
 
         jere 67  =(ground truth)−(actual output)
 
     In one implementation, the training rule is defined as: 
           nm ←   nm +α( t   m −φ m )α n  
 
     In the equation above: the arrow indicates an update of the value; t m  is the target value of neuron m; φ m  is the computed current output of neuron m; α n  is input n; and α is the learning rate. 
     The intermediary step in the training includes generating a feature vector from the input data using the convolution layers. The gradient with respect to the weights in each layer, starting at the output, is calculated. This is referred to as the backward pass, or going backwards. The weights in the network are updated using a combination of the negative gradient and previous weights. 
     In one implementation, the convolutional neural network uses a stochastic gradient update algorithm (such as ADAM) that performs backward propagation of errors by means of gradient descent. One example of a sigmoid function based back propagation algorithm is described below: 
     
       
         
           
             ϕ 
             = 
             
               
                 f 
                  
                 
                   ( 
                   h 
                   ) 
                 
               
               = 
               
                 1 
                 
                   1 
                   + 
                   
                     e 
                     
                       - 
                       h 
                     
                   
                 
               
             
           
         
       
     
     In the sigmoid function above, h is the weighted sum computed by a neuron. The sigmoid function has the following derivative: 
     
       
         
           
             
               
                 ∂ 
                 ϕ 
               
               
                 ∂ 
                 h 
               
             
             = 
             
               ϕ 
                
               
                 ( 
                 
                   1 
                   - 
                   ϕ 
                 
                 ) 
               
             
           
         
       
     
     The algorithm includes computing the activation of all neurons in the network, yielding an output for the forward pass. The activation of neuron M in the hidden layers is described as: 
     
       
         
           
             
               ϕ 
               m 
             
             = 
             
               1 
               
                 1 
                 + 
                 
                   e 
                   
                     - 
                     hm 
                   
                 
               
             
           
         
       
       
         
           
             
               h 
               m 
             
             = 
             
               
                 ∑ 
                 
                   n 
                   = 
                   1 
                 
                 N 
               
                
               
                 
                   a 
                   n 
                 
                  
                 
                   w 
                   nm 
                 
               
             
           
         
       
     
     This is done for all the hidden layers to get the activation described as: 
     
       
         
           
             
               ϕ 
               k 
             
             = 
             
               1 
               
                 1 
                 + 
                 
                   e 
                   
                     - 
                     hm 
                   
                 
               
             
           
         
       
       
         
           
             
               h 
               k 
             
             = 
             
               
                 ∑ 
                 
                   m 
                   = 
                   1 
                 
                 M 
               
                
               
                 
                   ϕ 
                   m 
                 
                  
                 
                   v 
                   mk 
                 
               
             
           
         
       
     
     Then, the error and the correct weights are calculated per layer. The error at the output is computed as: 
       δ ok =( t   k φ k )φ k (1−φ k )
 
     The error in the hidden layers is calculated as: 
     
       
         
           
             
               δ 
               hm 
             
             = 
             
               
                 
                   ϕ 
                   m 
                 
                  
                 
                   ( 
                   
                     1 
                     - 
                     
                       ϕ 
                       m 
                     
                   
                   ) 
                 
               
                
               
                 
                   ∑ 
                   
                     k 
                     = 
                     1 
                   
                   K 
                 
                  
                 
                   
                     v 
                     mk 
                   
                    
                   
                     δ 
                     ok 
                   
                 
               
             
           
         
       
     
     The weights of the output layer are updated as: 
         mk← mk+αδokφm
 
     The weights of the hidden layers are updated using the learning rate a as: 
         nm← nm+αδhmαn
 
     In one implementation, the convolutional neural network uses a gradient descent optimization to compute the error across all the layers. In such an optimization, for an input feature vector x and the predicted output ŷ, the loss function is defined as l for the cost of predicting ŷ when the target is y, i.e. l (ŷ, y). The predicted output ŷ is transformed from the input feature vector x using function ƒ. Function ƒ is parameterized by the weights of convolutional neural network, i.e. ŷ=ƒ w (x). The loss function is described as l(ŷ, y)=l(f w (x), y), or Q(z, w)=l(ƒ w  (x), y) where z is an input and output data pair (x, y). The gradient descent optimization is performed by updating the weights according to: 
     
       
         
           
             
                
               
                 t 
                 + 
                 1 
               
             
             = 
             
               
                 μ 
                  
                 
                     
                 
                  
                 
                    
                   t 
                 
               
               - 
               
                 α 
                  
                 
                   1 
                   n 
                 
                  
                 
                   
                     ∑ 
                     
                       i 
                       = 
                       1 
                     
                     N 
                   
                    
                   
                     
                       ∇ 
                       
                         w 
                         t 
                       
                     
                      
                     
                       Q 
                        
                       
                         ( 
                         
                           
                             z 
                             t 
                           
                           , 
                           
                             w 
                             t 
                           
                         
                         ) 
                       
                     
                   
                 
               
             
           
         
       
       
         
           
             
                
               
                 t 
                 + 
                 1 
               
             
             = 
             
               
                  
                 t 
               
               + 
               
                  
                 
                   t 
                   + 
                   1 
                 
               
             
           
         
       
     
     In the equations above, α is the learning rate. Also, the loss is computed as the average over a set of n data pairs. The computation is terminated when the learning rate α is small enough upon linear convergence. In other implementations, the gradient is calculated using only selected data pairs fed to a Nesterov&#39;s accelerated gradient and an adaptive gradient to inject computation efficiency. 
     In one implementation, the convolutional neural network uses a stochastic gradient descent (SGD) to calculate the cost function. A SGD approximates the gradient with respect to the weights in the loss function by computing it from only one, randomized, data pair, Z t , described as: 
           t+1   =μ     −α∇wQ ( z   t   , w   t ) 
           t+1 =   t +   t+1    
     In the equations above: α is the learning rate; μ is the momentum; and t is the current weight state before updating. The convergence speed of SGD is approximately O(1/t) when the learning rate α are reduced both fast and slow enough. In other implementations, the convolutional neural network uses different loss functions such as Euclidean loss and softmax loss. In a further implementation, an Adam stochastic optimizer is used by the convolutional neural network. 
     Convolution Layers 
     The convolution layers of the convolutional neural network serve as feature extractors. Convolution layers act as adaptive feature extractors capable of learning and decomposing the input data into hierarchical features. In one implementation, the convolution layers take two images as input and produce a third image as output. In such an implementation, convolution operates on two images in two-dimension (2D), with one image being the input image and the other image, called the “kernel”, applied as a filter on the input image, producing an output image. Thus, for an input vector ƒ of length n and a kernel g of length m, the convolution ƒ*g of ƒ and g is defined as: 
     
       
         
           
             
               
                 ( 
                 
                   f 
                   * 
                   g 
                 
                 ) 
               
                
               
                 ( 
                 i 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   j 
                   = 
                   1 
                 
                 m 
               
                
               
                 
                   g 
                    
                   
                     ( 
                     j 
                     ) 
                   
                 
                 · 
                 
                   f 
                    
                   
                     ( 
                     
                       i 
                       - 
                       j 
                       + 
                       
                         m 
                         / 
                         2 
                       
                     
                     ) 
                   
                 
               
             
           
         
       
     
     The convolution operation includes sliding the kernel over the input image. For each position of the kernel, the overlapping values of the kernel and the input image are multiplied and the results are added. The sum of products is the value of the output image at the point in the input image where the kernel is centered. The resulting different outputs from many kernels are called feature maps. 
     Once the convolutional layers are trained, they are applied to perform recognition tasks on new inference data. Since the convolutional layers learn from the training data, they avoid explicit feature extraction and implicitly learn from the training data. Convolution layers use convolution filter kernel weights, which are determined and updated as part of the training process. The convolution layers extract different features of the input, which are combined at higher layers. The convolutional neural network uses a various number of convolution layers, each with different convolving parameters such as kernel size, strides, padding, number of feature maps and weights. 
     Non-Linear Layers 
       FIG. 12  shows one implementation of non-linear layers in accordance with one implementation of the technology disclosed. Non-linear layers use different non-linear trigger functions to signal distinct identification of likely features on each hidden layer. Non-linear layers use a variety of specific functions to implement the non-linear triggering, including the rectified linear units (ReLUs), hyperbolic tangent, absolute of hyperbolic tangent, sigmoid and continuous trigger (non-linear) functions. In one implementation, a ReLU activation implements the function y=max(x, 0) and keeps the input and output sizes of a layer the same. The advantage of using ReLU is that the convolutional neural network is trained many times faster. ReLU is a non-continuous, non-saturating activation function that is linear with respect to the input if the input values are larger than zero and zero otherwise. Mathematically, a ReLU activation function is described as: 
     
       
         
           
             
               ϕ 
                
               
                 ( 
                 h 
                 ) 
               
             
             = 
             
               max 
                
               
                 ( 
                 
                   h 
                   , 
                   0 
                 
                 ) 
               
             
           
         
       
       
         
           
             
               ϕ 
                
               
                 ( 
                 h 
                 ) 
               
             
             = 
             
               { 
               
                 
                   
                     h 
                   
                   
                     
                       
                         if 
                          
                         
                             
                         
                          
                         h 
                       
                       &gt; 
                       0 
                     
                   
                 
                 
                   
                     0 
                   
                   
                     
                       
                         if 
                          
                         
                             
                         
                          
                         h 
                       
                       ≤ 
                       0 
                     
                   
                 
               
             
           
         
       
     
     In other implementations, the convolutional neural network uses a power unit activation function, which is a continuous, non-saturating function described by: 
       φ( h )=( a+bh ) c  
 
     In the equation above, a, b and c are parameters controlling the shift, scale and power respectively. The power activation function is able to yield x and y-antisymmetric activation if c is odd and y-symmetric activation if c is even. In some implementations, the unit yields a non-rectified linear activation. 
     In yet other implementations, the convolutional neural network uses a sigmoid unit activation function, which is a continuous, saturating function described by the following logistic function: 
     
       
         
           
             
               ϕ 
                
               
                 ( 
                 h 
                 ) 
               
             
             = 
             
               1 
               
                 1 
                 + 
                 
                   e 
                   
                     
                       - 
                       β 
                     
                      
                     h 
                   
                 
               
             
           
         
       
     
     In the equation above, β=1. The sigmoid unit activation function does not yield negative activation and is only antisymmetric with respect to the y-axis. 
     Dilated Convolutions 
       FIG. 13  illustrates dilated convolutions. Dilated convolutions, sometimes called atrous convolutions, which literally means with holes. The French name has its origins in the algorithms a trous, which computes the fast dyadic wavelet transform. In these types of convolutional layers, the inputs corresponding to the receptive field of the filters are not neighboring points. This is illustrated in  FIG. 13 . The distance between the inputs is dependent on the dilation factor. 
     Sub-Sampling Layers 
       FIG. 14  is one implementation of sub-sampling layers in accordance with one implementation of the technology disclosed. Sub-sampling layers reduce the resolution of the features extracted by the convolution layers to make the extracted features or feature maps-robust against noise and distortion. In one implementation, sub-sampling layers employ two types of pooling operations, average pooling and max pooling. The pooling operations divide the input into non-overlapping two-dimensional spaces. For average pooling, the average of the four values in the region is calculated. For max pooling, the maximum value of the four values is selected. 
     In one implementation, the sub-sampling layers include pooling operations on a set of neurons in the previous layer by mapping its output to only one of the inputs in max pooling and by mapping its output to the average of the input in average pooling. In max pooling, the output of the pooling neuron is the maximum value that resides within the input, as described by: 
       φ o =max(φ 1 , φ 2 , . . . , φ N )
 
     In the equation above, N is the total number of elements within a neuron set. 
     In average pooling, the output of the pooling neuron is the average value of the input values that reside with the input neuron set, as described by: 
     
       
         
           
             
               ϕ 
               o 
             
             = 
             
               
                 1 
                 N 
               
                
               
                 
                   ∑ 
                   
                     n 
                     = 
                     1 
                   
                   N 
                 
                  
                 
                   ϕ 
                   n 
                 
               
             
           
         
       
     
     In the equation above, N is the total number of elements within input neuron set. 
     In  FIG. 14 , the input is of size 4×4. For 2×2 sub-sampling, a 4×4 image is divided into four non-overlapping matrices of size 2×2. For average pooling, the average of the four values is the whole-integer output. For max pooling, the maximum value of the four values in the 2×2 matrix is the whole-integer output. 
     CONVOLUTION EXAMPLES 
       FIG. 15  depicts one implementation of a two-layer convolution of the convolution layers. In  FIG. 15 , an input of size 2048 dimensions is convolved. At convolution 1, the input is convolved by a convolutional layer comprising of two channels of sixteen kernels of size 3×3. The resulting sixteen feature maps are then rectified by means of the ReLU activation function at ReLU1 and then pooled in Pool 1 by means of average pooling using a sixteen channel pooling layer with kernels of size 3×3. At convolution 2, the output of Pool 1 is then convolved by another convolutional layer comprising of sixteen channels of thirty kernels with a size of 3×3. This is followed by yet another ReLU2 and average pooling in Pool 2 with a kernel size of 2×2. The convolution layers use varying number of strides and padding, for example, zero, one, two and three. The resulting feature vector is five hundred and twelve (512) dimensions, according to one implementation. 
     In other implementations, the convolutional neural network uses different numbers of convolution layers, sub-sampling layers, non-linear layers and fully connected layers. In one implementation, the convolutional neural network is a shallow network with fewer layers and more neurons per layer, for example, one, two or three fully connected layers with hundred (100) to two hundred (200) neurons per layer. In another implementation, the convolutional neural network is a deep network with more layers and fewer neurons per layer, for example, five (5), six (6) or eight (8) fully connected layers with thirty (30) to fifty (50) neurons per layer. 
     Forward Pass 
     The output of a neuron of row x, column y in the P i  convolution layer and k th  feature map for f number of convolution cores in a feature map is determined by the following equation: 
     
       
         
           
             
               O 
               
                 x 
                 , 
                 y 
               
               
                 ( 
                 
                   l 
                   , 
                   k 
                 
                 ) 
               
             
             = 
             
               tanh 
                
               
                 ( 
                 
                   
                     
                       ∑ 
                       
                         t 
                         = 
                         0 
                       
                       
                         f 
                         - 
                         1 
                       
                     
                      
                     
                       
                         ∑ 
                         
                           r 
                           = 
                           0 
                         
                         
                           k 
                           h 
                         
                       
                        
                       
                         
                           ∑ 
                           
                             c 
                             = 
                             0 
                           
                           
                             k 
                             w 
                           
                         
                          
                         
                           
                             W 
                             
                               ( 
                               
                                 r 
                                 , 
                                 c 
                               
                               ) 
                             
                             
                               ( 
                               
                                 k 
                                 , 
                                 t 
                               
                               ) 
                             
                           
                            
                           
                             O 
                             
                               ( 
                               
                                 
                                   x 
                                   + 
                                   r 
                                 
                                 , 
                                 
                                   x 
                                   + 
                                   c 
                                 
                               
                               ) 
                             
                             
                               ( 
                               
                                 
                                   l 
                                   - 
                                   1 
                                 
                                 , 
                                 t 
                               
                               ) 
                             
                           
                         
                       
                     
                   
                   + 
                   
                     Bias 
                     
                       ( 
                       
                         l 
                         , 
                         k 
                       
                       ) 
                     
                   
                 
                 ) 
               
             
           
         
       
     
     The output of a neuron of row x, column y in the l th  sub-sample layer and k th  feature map is determined by the following equation: 
     
       
         
           
             
               O 
               
                 x 
                 , 
                 y 
               
               
                 ( 
                 
                   l 
                   , 
                   k 
                 
                 ) 
               
             
             = 
             
               tanh 
                
               
                 ( 
                 
                   
                     
                       W 
                       
                         ( 
                         k 
                         ) 
                       
                     
                      
                     
                       
                         ∑ 
                         
                           r 
                           = 
                           0 
                         
                         
                           S 
                           h 
                         
                       
                        
                       
                         
                           ∑ 
                           
                             c 
                             = 
                             0 
                           
                           
                             S 
                             w 
                           
                         
                          
                         
                           O 
                           
                             ( 
                             
                               
                                 
                                   x 
                                   × 
                                   
                                     S 
                                     h 
                                   
                                 
                                 + 
                                 r 
                               
                               , 
                               
                                 
                                   y 
                                   × 
                                   
                                     S 
                                     w 
                                   
                                 
                                 + 
                                 c 
                               
                             
                             ) 
                           
                           
                             ( 
                             
                               
                                 l 
                                 - 
                                 1 
                               
                               , 
                               k 
                             
                             ) 
                           
                         
                       
                     
                   
                   + 
                   
                     Bias 
                     
                       ( 
                       
                         l 
                         , 
                         k 
                       
                       ) 
                     
                   
                 
                 ) 
               
             
           
         
       
     
     The output of an i th  neuron of the l th  output layer is determined by the following equation: 
     
       
         
           
             
               O 
               
                 ( 
                 
                   l 
                   , 
                   i 
                 
                 ) 
               
             
             = 
             
               tanh 
                
               
                 ( 
                 
                   
                     
                       ∑ 
                       
                         j 
                         = 
                         0 
                       
                       H 
                     
                      
                     
                       
                         O 
                         
                           ( 
                           
                             
                               l 
                               - 
                               1 
                             
                             , 
                             j 
                           
                           ) 
                         
                       
                        
                       
                         W 
                         
                           ( 
                           
                             i 
                             , 
                             j 
                           
                           ) 
                         
                         l 
                       
                     
                   
                   + 
                   
                     Bias 
                     
                       ( 
                       
                         l 
                         , 
                         i 
                       
                       ) 
                     
                   
                 
                 ) 
               
             
           
         
       
     
     Backpropagation 
     The output deviation of a k th  neuron in the output layer is determined by the following equation: 
         d ( O   k   o )= y   k   −t   k    
     The input deviation of a k th  neuron in the output layer is determined by the following equation: 
         d ( I   k   o )=( y   k   −t   k )φ′(ν k )=φ′ν k ) d ( O   o   k )
 
     The weight and bias variation of a k th  neuron in the output layer is determined by the following equation: 
       Δ W   k,x   o )= d ( i   k   o )= d ( I   o   k ) y   k,x  
 
       ΔBias  k   o )= d ( I   k   o )
 
     The output bias of a k th  neuron in the hidden layer is determined by the following equation: 
     
       
         
           
             
               d 
                
               
                 ( 
                 
                   O 
                   k 
                   H 
                 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   i 
                   = 
                   0 
                 
                 
                   i 
                   &lt; 
                   84 
                 
               
                
               
                 
                   d 
                    
                   
                     ( 
                     
                       I 
                       i 
                       o 
                     
                     ) 
                   
                 
                  
                 
                   W 
                   
                     i 
                     , 
                     k 
                   
                 
               
             
           
         
       
     
     The input bias of a k th  neuron in the hidden layer is determined by the following equation: 
         d ( I   k   H )=φ′(ν k ) d ( O   k   H )
 
     The weight and bias variation in row x, column y in a m th  feature map of a prior layer receiving input from k neurons in the hidden layer is determined by the following equation: 
       Δ W   m,x,y   H,k )= d ( I   k   H ) y   x,y   m  
 
       ΔBias k   H )= d ( I   k   H )
 
     The output bias of row x, column y in a m th  feature map of sub-sample layer S is determined by the following equation: 
     
       
         
           
             
               d 
                
               
                 ( 
                 
                   O 
                   
                     x 
                     , 
                     y 
                   
                   
                     S 
                     , 
                     m 
                   
                 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 k 
                 
                   1 
                    
                   7 
                    
                   0 
                 
               
                
               
                 
                   d 
                    
                   
                     ( 
                     
                       I 
                       
                         m 
                         , 
                         x 
                         , 
                         y 
                       
                       H 
                     
                     ) 
                   
                 
                  
                 
                   W 
                   
                     m 
                     , 
                     x 
                     , 
                     y 
                   
                   
                     H 
                     , 
                     k 
                   
                 
               
             
           
         
       
     
     The input bias of row x, column y in a m th  feature map of sub-sample layer S is determined by the following equation: 
         d ( I   x,y   S,m )=φ′(ν k ) d ( O   x,y   S,m )
 
     The weight and bias variation in row x, column y in a m th  feature map of sub-sample layer S and convolution layer C is determined by the following equation: 
     
       
         
           
             
               
                 
                   
                     Δ 
                      
                     
                       W 
                       
                         S 
                         , 
                         m 
                       
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         x 
                         = 
                         0 
                       
                       fh 
                     
                      
                     
                       
                         ∑ 
                         
                           y 
                           = 
                           0 
                         
                         fw 
                       
                        
                       
                         
                           d 
                            
                           
                             ( 
                             
                               I 
                               
                                 
                                   [ 
                                   
                                     x 
                                     / 
                                     2 
                                   
                                   ] 
                                 
                                 , 
                                 
                                   [ 
                                   
                                     y 
                                     / 
                                     2 
                                   
                                   ] 
                                 
                               
                               
                                 S 
                                 , 
                                 m 
                               
                             
                             ) 
                           
                         
                          
                         
                           O 
                           
                             x 
                             , 
                             y 
                           
                           
                             C 
                             , 
                             m 
                           
                         
                       
                     
                   
                 
                  
                 
                   
 
                 
                  
                 
                   Δ 
                    
                   
                       
                   
                    
                   
                     Bias 
                     
                       S 
                       , 
                       m 
                     
                   
                 
               
               ) 
             
             = 
             
               
                 ∑ 
                 
                   x 
                   = 
                   0 
                 
                 fh 
               
                
               
                 
                   ∑ 
                   
                     y 
                     = 
                     0 
                   
                   fw 
                 
                  
                 
                   d 
                    
                   
                     ( 
                     
                       O 
                       
                         x 
                         , 
                         y 
                       
                       
                         S 
                         , 
                         m 
                       
                     
                     ) 
                   
                 
               
             
           
         
       
     
     The output bias of row x, column y in a k th  feature map of convolution layer C is determined by the following equation: 
         d ( O   x,y   C,k )= d  ( I   [x/2],[y/2])   W   k    
     The input bias of row x, column y in a k th  feature map of convolution layer C is determined by the following equation: 
         d ( I   x,y   C,k )=φ′(ν k ) d ( O   x,y   C,k )
 
     The weight and bias variation in row r, column c in an m th  convolution core of a k th  feature map of l h  convolution layer C: 
     
       
         
           
             
               
                 
                   
                     Δ 
                      
                     
                         
                     
                      
                     
                       W 
                       
                         r 
                         , 
                         c 
                       
                       
                         k 
                         , 
                         m 
                       
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         x 
                         = 
                         0 
                       
                       fh 
                     
                      
                     
                       
                         ∑ 
                         
                           y 
                           = 
                           0 
                         
                         fw 
                       
                        
                       
                         
                           d 
                            
                           
                             ( 
                             
                               I 
                               
                                 x 
                                 , 
                                 y 
                               
                               
                                 C 
                                 , 
                                 k 
                               
                             
                             ) 
                           
                         
                          
                         
                           O 
                           
                             
                               x 
                               + 
                               r 
                             
                             , 
                             
                               y 
                               + 
                               c 
                             
                           
                           
                             
                               l 
                               - 
                               1 
                             
                             , 
                             m 
                           
                         
                       
                     
                   
                 
                  
                 
                   
 
                 
                  
                 
                   Δ 
                    
                   
                       
                   
                    
                   
                     Bias 
                     
                       C 
                       , 
                       k 
                     
                   
                 
               
               ) 
             
             = 
             
               
                 ∑ 
                 
                   x 
                   = 
                   0 
                 
                 fh 
               
                
               
                 
                   ∑ 
                   
                     y 
                     = 
                     0 
                   
                   fw 
                 
                  
                 
                   d 
                    
                   
                     ( 
                     
                       I 
                       
                         x 
                         , 
                         y 
                       
                       
                         C 
                         , 
                         k 
                       
                     
                     ) 
                   
                 
               
             
           
         
       
     
     Residual Connections 
       FIG. 16  depicts a residual connection that reinjects prior information downstream via feature-map addition. A residual connection comprises reinjecting previous representations into the downstream flow of data by adding a past output tensor to a later output tensor, which helps prevent information loss along the data-processing flow. Residual connections tackle two common problems that plague any large-scale deep-learning model: vanishing gradients and representational bottlenecks. In general, adding residual connections to any model that has more than 10 layers is likely to be beneficial. As discussed above, a residual connection comprises making the output of an earlier layer available as input to a later layer, effectively creating a shortcut in a sequential network. Rather than being concatenated to the later activation, the earlier output is summed with the later activation, which assumes that both activations are the same size. If they are of different sizes, a linear transformation to reshape the earlier activation into the target shape can be used. 
     Residual Learning and Skip-Connections 
       FIG. 17  depicts one implementation of residual blocks and skip-connections. The main idea of residual learning is that the residual mapping is much easier to be learned than the original mapping. Residual network stacks a number of residual units to alleviate the degradation of training accuracy. Residual blocks make use of special additive skip connections to combat vanishing gradients in deep neural networks. At the beginning of a residual block, the data flow is separated into two streams: the first carries the unchanged input of the block, while the second applies weights and non-linearities. At the end of the block, the two streams are merged using an element-wise sum. The main advantage of such constructs is to allow the gradient to flow through the network more easily. 
     Benefited from residual network, deep convolutional neural networks (CNNs) can be easily trained and improved accuracy has been achieved for image classification and object detection. Convolutional feed-forward networks connect the output of the l th  layer as input to the (l+1) th  layer, which gives rise to the following layer transition: x l =H 1  (x l−1 ) . Residual blocks add a skip-connection that bypasses the non-linear transformations with an identify function: x i =H l (x l−1 ) +x 1 1 . An advantage of residual blocks is that the gradient can flow directly through the identity function from later layers to the earlier layers. However, the identity function and the output of H 1  are combined by summation, which may impede the information flow in the network. 
     WaveNet 
     The WaveNet is a deep neural network for generating raw audio waveforms. The WaveNet distinguishes itself from other convolutional networks since it is able to take relatively large ‘visual fields’ at low cost. Moreover, it is able to add conditioning of the signals locally and globally, which allows the WaveNet to be used as a text to speech (TTS) engine with multiple voices, is the TTS gives local conditioning and the particular voice the global conditioning. 
     The main building blocks of the WaveNet are the causal dilated convolutions. As an extension on the causal dilated convolutions, theWaveNet also allows stacks of these convolutions, as shown in  FIG. 18 . To obtain the same receptive field with dilated convolutions in this figure, another dilation layer is required. The stacks are a repetition of the dilated convolutions, connecting the outputs of dilated convolution layer to a single output. This enables the WaveNet to get a large ‘visual’ field of one output node at a relatively low computational cost. For comparison, to get a visual field of 512 inputs, a fully convolutional network (FCN) would require 511 layers. In the case of a dilated convolutional network, we would need eight layers. The stacked dilated convolutions only need seven layers with two stacks or six layers with four stacks. To get an idea of the differences in computational power required for covering the same visual field, the following table shows the number of weights required in the network with the assumption of one filter per layer and a filter width of two. Furthermore, it is assumed that the network is using binary encoding of the 8 bits. 
     
       
         
           
               
               
               
               
               
             
               
                   
                   
               
               
                   
                 Network 
                 No. 
                 No. weights 
                 Total No. of 
               
               
                   
                 type 
                 stacks 
                 per channel 
                 weights 
               
               
                   
                   
               
             
            
               
                   
                 FCN 
                 1 
                 2.6 · 10 5   
                 2.6 · 10 6   
               
               
                   
                 WN 
                 1 
                 1022 
                 8176 
               
               
                   
                 WN 
                 2 
                 1022 
                 8176 
               
               
                   
                 WN 
                 4 
                 508 
                 4064 
               
               
                   
                   
               
            
           
         
       
     
     The WaveNet adds a skip connection before the residual connection is made, which bypasses all the following residual blocks. Each of these skip connections is summed before passing them through a series of activation functions and convolutions. Intuitively, this is the sum of the information extracted in each layer. 
     Batch Normalization 
     Batch normalization is a method for accelerating deep network training by making data standardization an integral part of the network architecture. Batch normalization can adaptively normalize data even as the mean and variance change over time during training. It works by internally maintaining an exponential moving average of the batch-wise mean and variance of the data seen during training. The main effect of batch normalization is that it helps with gradient propagation—much like residual connections—and thus allows for deep networks. Some very deep networks can only be trained if they include multiple Batch Normalization layers. 
     Batch normalization can be seen as yet another layer that can be inserted into the model architecture, just like the fully connected or convolutional layer. The BatchNormalization layer is typically used after a convolutional or densely connected layer. It can also be used before a convolutional or densely connected layer. Both implementations can be used by the technology disclosed and are shown in  FIG. 22 . The BatchNormalization layer takes an axis argument, which specifies the feature axis that should be normalized. This argument defaults to -1, the last axis in the input tensor. This is the correct value when using Dense layers, Conv1D layers, RNN layers, and Conv2D layers with data_format set to “channels_last”. But in the niche use case of Conv2D layers with data _format set to “channels_first”, the features axis is axis 1; the axis gument in BatchNormalization can be set to 1. 
     Batch normalization provides a definition for feed-forwarding the input and computing the gradients with respect to the parameters and its own input via a backward pass. In practice, batch normalization layers are inserted after a convolutional or fully connected layer, but before the outputs are fed into an activation function. For convolutional layers, the different elements of the same feature map—i.e. the activations—at different locations are normalized in the same way in order to obey the convolutional property. Thus, all activations in a mini-batch are normalized over all locations, rather than per activation. 
     The internal covariate shift is the major reason why deep architectures have been notoriously slow to train. This stems from the fact that deep networks do not only have to learn a new representation at each layer, but also have to account for the change in their distribution. 
     The covariate shift in general is a known problem in the deep learning domain and frequently occurs in real-world problems. A common covariate shift problem is the difference in the distribution of the training and test set which can lead to suboptimal generalization performance. This problem is usually handled with a standardization or whitening preprocessing step. However, especially the whitening operation is computationally expensive and thus impractical in an online setting, especially if the covariate shift occurs throughout different layers. 
     The internal covariate shift is the phenomenon where the distribution of network activations change across layers due to the change in network parameters during training. Ideally, each layer should be transformed into a space where they have the same distribution but the functional relationship stays the same. In order to avoid costly calculations of covariance matrices to de-correlate and whiten the data at every layer and step, we normalize the distribution of each input feature in each layer across each mini-batch to have zero mean and a standard deviation of one. 
     Forward Pass 
     During the forward pass, the mini-batch mean and variance are calculated. With these mini-batch statistics, the data is normalized by subtracting the mean and dividing by the standard deviation. Finally, the data is scaled and shifted with the learned scale and shift parameters. The batch normalization forward pass ƒ BN  is depicted in  FIG. 19 . 
     In  FIG. 19 , μ β  is the batch mean and σ β   2  is the batch variance, respectively. The learned scale and shift parameters are denoted by γ and β, respectively. For clarity, the batch normalization procedure is described herein per activation and omit the corresponding indices. 
     Since normalization is a differentiable transform, the errors are propagated into these learned parameters and are thus able to restore the representational power of the network by learning the identity transform. Conversely, by learning scale and shift parameters that are identical to the corresponding batch statistics, the batch normalization transform exhibits little or no effect on the network, if that was the optimal operation to perform. At test time, the batch mean and variance are replaced by the respective population statistics since the input does not depend on other samples from a mini-batch. Another method is to keep running averages of the batch statistics during training and to use these to compute the network output at test time. At test time, the batch normalization transform can be expressed as illustrated in  FIG. 20 . In  FIG. 20 , μ D  and σ D   2  denote the population mean and variance, rather than the batch statistics, respectively. 
     Backward Pass 
     Since normalization is a differentiable operation, the backward pass can be computed as depicted in  FIG. 21 . 
     1D Convolution 
     1D convolutions extract local 1D patches or subsequences from sequences, as shown in  FIG. 23 .  1 D convolution obtains each output timestep from a temporal patch in the input sequence. 1D convolution layers recognize local patters in a sequence. Because the same input transformation is performed on every patch, a pattern learned at a certain position in the input sequences can be later recognized at a different position, making 1D convolution layers translation invariant for temporal translations. For instance, a 1D convolution layer processing sequences of bases using convolution windows of size 5 should be able to learn bases or base sequences of length 5 or less, and it should be able to recognize the base motifs in any context in an input sequence. A base-level 1D convolution is thus able to learn about base morphology. 
     Global Average Pooling 
       FIG. 24  illustrates how global average pooling (GAP) works. Global average pooling can be use used to replace fully connected (FC) layers for classification, by taking the spatial average of features in the last layer for scoring. The reduces the training load and bypasses overfitting issues. Global average pooling applies a structural prior to the model and it is equivalent to linear transformation with predefined weights. Global average pooling reduces the number of parameters and eliminates the fully connected layer. Fully connected layers are typically the most parameter and connection intensive layers, and global average pooling provides much lower-cost approach to achieve similar results. The main idea of global average pooling is to generate the average value from each last layer feature map as the confidence factor for scoring, feeding directly into the softmax layer. 
     Global average pooling have three benefits: (1) there are no extra parameters in global average pooling layers thus overfitting is avoided at global average pooling layers; (2) since the output of global average pooling is the average of the whole feature map, global average pooling will be more robust to spatial translations; and (3) because of the huge number of parameters in fully connected layers which usually take over 50% in all the parameters of the whole network, replacing them by global average pooling layers can significantly reduce the size of the model, and this makes global average pooling very useful in model compression. 
     Global average pooling makes sense, since stronger features in the last layer are expected to have a higher average value. In some implementations, global average pooling can be used as a proxy for the classification score. The feature maps under global average pooling can be interpreted as confidence maps, and force correspondence between the feature maps and the categories. Global average pooling can be particularly effective if the last layer features are at a sufficient abstraction for direct classification; however, global average pooling alone is not enough if multilevel features should be combined into groups like parts models, which is best performed by adding a simple fully connected layer or other classifier after the global average pooling. 
     Definitions 
     As used herein, the term “module” refers to a processor that receives information characterizing input data and generates an alternative representation and/or characterization of the input data. A neural network is an example of a module. Other examples of a module include a multilayer perceptron (MLP), a feed-forward neural network, a recursive neural network, a recurrent neural network, a deep neural network, a shallow neural network, a fully-connected neural network, a sparsely-connected neural network, a convolutional neural network that comprises a fully-connected neural network, a fully convolutional network without a fully-connected neural network, a deep stacking neural network, a deep belief network, a residual network, echo state network, liquid state machine, highway network, maxout network, long short-term memory (LSTM) network, recursive neural network grammar (RNNG), gated recurrent unit (GRU), pre-trained and frozen neural networks, and so on. Yet other examples of a module include individual components of a convolutional neural network, such as a one- dimensional (1D) convolution module, a two-dimensional (2D) convolution module, a three-dimensional (3D) convolution module, a feature extraction module, a dimensionality reduction module, a pooling module, a subsampling module, a batch normalization module, a concatenation module, a classification module, a regularization module, and so on. In implementations, a module comprises learnable submodules, parameters, and hyperparameters that can be trained by back-propagating the errors using an optimization algorithm. The optimization algorithm can be based on stochastic gradient descent (or other variations of gradient descent like batch gradient descent and mini-batch gradient descent). Some examples of optimization algorithms used by the technology disclosed include Momentum, Nesterov accelerated gradient, Adagrad, Adadelta, RMSprop, and Adam. In implementations, a module is an activation module that applies a non-linearity function. Some examples of non-linearity functions used by the technology disclosed include a sigmoid function, rectified linear units (ReLUs), hyperbolic tangent function, absolute of hyperbolic tangent function, leaky ReLUs (LReLUs), and parametrized ReLUs (PReLUs). In implementations, a module is a classification module. Some examples of classifiers used by the technology disclosed include a multi-class support vector machine (SVM), a Softmax classifier, and a multinomial logistic regressor. Other examples of classifiers used by the technology disclosed include a rule-based classifier. In implementations, a module is a pre-processing module, such as an input module, a normalization module, a patch-extraction module, and a noise-addition module. In implementations, a module is a post-processing module, such as an output module, an estimation module, and a modelling module. Two modules differ in “type” if they differ in at least one submodule, parameter, or hyperparameter. In some implementations, certain modules are fixed topology modules in which a certain set of submodules are not evolved/modified and/or only evolved/modified in certain generations, and only the interconnections and interconnection weights between the submodules are evolved. 
     Any other conventional or future-developed neural networks or components thereof or used therein, are considered to be modules. Such implementations will be readily apparent to those skilled in the art without departing from the spirit and scope of the technology disclosed. 
     As used herein, the term “submodule” refers to a processing element of a module. For example, in the case of a fully-connected neural network, a submodule is a neuron of the neural network. In another example, a layer of neurons, i.e., a neuron layer, is considered a submodule of the fully-connected neural network module. In other examples, in the case of a convolutional neural network, a kernel, a filter, a feature extractor, an activation function, a pooling operation, a subsampling operation, and a regularization operation, are each considered submodules of the convolutional neural network module. In some implementations, the submodules are considered as modules, and vice-versa. 
     A reporting application includes executable machine instructions that when executed by a processor perform at least initiating one or more reporting action(s). Some types of reporting actions are a regulatory reporting process, filling out part of a regulatory report, concluding at least instructing closing an existing regulatory reporting process, modifying a parameter of metadata stored in association with a regulatory reporting process, submitting a full regulatory report, reporting notice of an anomaly to a market actor, other reporting, and combinations thereof. 
     A remedial application includes executable machine instructions that when executed by a processor perform at least initiating one or more remedial action(s). Some types of remedial actions are changing the regulatory status of a pharmacy, initiating a freeze on a lot or production run of medications in the event of consistent and verifiable adverse reports, notifying an interested third party, and order more substance, signal that a set of transactions is no longer permitted, change regulatory status of a pharmacy, blocking or disallowing transacting on the blockchain of either potentially counterfeit lot(s), other remedial actions, and combinations thereof 
     An input data collecting application includes executable machine instructions that when executed by a processor perform at least initiating one or more data collection. Some types of data collection actions are displaying a prompt to a client to scan a barcode with the camera of a device, other types of sensed data collection, and combinations thereof. 
     An event type data is at least one selected from a set of a missing pill bottle(s), a mis-delivery of a therapeutic(s) stored on a blockchain, a mis-delivery of a medical service(s) delivered, a mis-coding of a therapeutic(s) or a service(s) properly delivered, an adulterated substance(s), a delivery(ies) not made, and a patient(s) sick or dead, or an adverse event(s) or product problem(s), other types of events identifiable from data, and combinations thereof. 
     Sensed information about a situation at a site includes detecting a presence of an adulterating substance, such as metallic or glass filings, medication color, a marking on a pill, foul or repugnant odors, an empty vial, a discolored contents, a cracked vial, a damaged packaging, a precipitated medicine inside, a mislabeled vial, other types of sensed information, and combinations thereof. 
     A system implementation of the technology disclosed includes one or more processors coupled to the memory. The memory is loaded with computer instructions which, when executed on the processors, cause evolution of a deep neural network structure. 
     The deep neural network structure disclosed herein includes a plurality of modules and interconnections among the modules. Examples of deep neural network structures include without limitation AlexNet, ResNet, Inception, WaveNet, PixelCNN, GoogLeNet, ENet, U-Net, BN-NIN, VGG, LeNet, DeepSEA, DeepChem, DeepBind, DeepMotif, FIDDLE, DeepLNC, DeepCpG, DeepCyTOF, and SPINDLE. 
     Particular Implementations 
     In one implementation, we disclose a computer-implemented method of efficiently implementing a blockchain pharmaceutical regulatory compliance system using a trained exception handling classifier on a data processor with a target architecture. The method includes detecting block-level events stored on a block chain, the events selected from a set of a missing pill bottle, an adulterated substance, a delivery not made, and a patient sick or dead. The method also includes triggering an application to perform one or more actions selected using an ensemble of neural network classifier(s) from a set of submit a regulatory report, notify an interested third party, and order more substance. 
     In one implementation, the method further includes selecting the action using an exception handling classifier trained using a training data set comprising a plurality of ground truth correspondences of drug identifications, exception events, and remedial actions. 
     In one alternative implementation, a first neural subnetwork is trained to classify input from a client sensed information into a block level exception event and a second neural subnetwork is trained to provide a remedial action. 
     In one implementation, the classifier is trained with a ground truth dataset comprising pairings of drug identifications with exception events including sensed discrepancies in the drug or its packaging, and remedial actions including prompts and instructions. In this implementation, the method further includes using the classifier, identifying a drug as an injectable drug in a vial, and triggering an action including prompting the user to specify sensed discrepancies selected for the drug identified. 
     In one implementation, the sensed discrepancies include one or more selected from an empty vial, a discolored contents, a cracked vial, a damaged packaging, a precipitated medicine inside, and a mislabeled vial. 
     In one implementation, the classifier is trained with a ground truth dataset comprising pairings of investigative situations with exception events including sensed discrepancies in the drug or its packaging, and remedial actions including capturing evidence of the discrepancies in the drug or its packaging. In this implementation, the method further includes using the classifier, identifying a drug or its packaging as exhibiting a discrepancy, and triggering an action including prompting the user to capture an image, record a sound or scan a bar code. 
     In one implementation, the classifier is trained with a ground truth dataset comprising pairings of drug identifications with exception events including sensed discrepancies in the drug or its packaging, and remedial actions include prompts and instructions; the method further comprising: using the classifier, identifying a drug as a radioactive drug in “wet packaging”, and triggering an action including prompting a user to step away from the drug and to notify a safety officer. In one implementation, the method further includes the classifier identifying a different drug as a non-radioactive injectable drug, and triggering an action including prompting to use caution to avoid getting cut by glass, but if possible, remove vial from outer carton. 
     In one implementation, the classifier is trained with a ground truth dataset comprising pairings of investigative situations with exception events including sensed discrepancies in the drug or its packaging, and remedial actions include capturing evidence of the discrepancies in the drug or its packaging. In this implementation, the method further comprises using the classifier, identifying two or more discrepancies of a drug shipped to different pharmacies by different wholesalers and each exhibiting evidence of a same discrepancy, and triggering an action including generating reporting escalating the discrepancy to the manufacturer as a cluster. 
     In one implementation, the method further includes the classifier identifying a common lot or other manufacturing characteristic in problematic vials, and triggering an action including generating a warning to the manufacturer that the common lot potentially has more problems. 
     In one implementation, the method further includes the classifier assigning weights and likelihoods to a recall and generating a report including the weights and likelihoods to the manufacturer. 
     In one implementation, the method further includes the classifier sharing the report including the weights and likelihoods to a regulatory authority; thereby enabling the regulatory authority lacking visibility into a supply chain to identify potential recalls. 
     In one implementation, the classifier is trained with a ground truth dataset comprising pairings of investigative situations with exception events including sensed discrepancies in the drug or its packaging, and remedial actions including capturing evidence of the discrepancies in the drug or its packaging. In this implementation, the method further comprises using the classifier, identifying a duplicate 2D barcode identifier in a first city identical to one in a second city as indicating a potentially counterfeit lot(s), and triggering an action of blocking or disallowing transacting on the blockchain of either potentially counterfeit lot(s). 
     In one implementation, the method further includes the classifier detecting whether barcode scans were separated by a specific period of time or threshold, and assigning a higher weight to a first temporally occurring scan as original and probably safe to administer, otherwise, the classifier assigning a like weight to the first and second temporally occurring scans; thereby indicating that each is counterfeit. 
     In one implementation, the classifier is trained with a ground truth dataset comprising pairings of investigative situations with exception events including sensed discrepancies in the drug or its packaging, and remedial actions including capturing evidence of the discrepancies in the drug or its packaging. In this implementation, the method using the classifier, identifying an aggregate number of orders added to the blockchain over a unit time period indicating a shortage, and triggering an action of generating a report to suppliers indicating the shortage; thereby enabling suppliers to pull forward the scheduled manufacturing runs. 
     In one implementation, the method further includes retrieving data from block-level events storing data from exception reports made to a regulatory body from a blockchain. 
     In one implementation, the method further includes retrieving data from block-level events storing data from databases in a supply chain. 
     In another implementation, we disclose a computer-implemented method of preparing a plurality of neural network systems to recognize exception events and drug identifications and to trigger applications that take remedial actions on a data processor with a target architecture. The method includes generating at a time t 0 , a training data set comprising 50,000 to 1 billion exception events, each exception event labelled with sensed discrepancy information and with drug identifications, and corresponding ground truth remedial actions. The method also includes subdividing the drug identifications into one or more overlapping drug categories. Training a first set of drug classifier neural networks with the drug identifications and the drug categories is also part of the method. The method also includes training a first set of exception classifier neural networks with the sensed information, drug identification information, drug category information, and the corresponding ground truth remedial actions. The method further includes saving parameters from training the recurrent neural networks in tangible machine readable memory for use in reporting or responding to exceptions in pharmaceuticals handling. 
     In one implementation, the method further includes generating a second training data set at a time t 1 , later in time than t 0 , including additional exception events reported after time t 0 ; and using the second training data set, performing the subdividing, training and saving steps to retrain the classifier neural networks and the training recurrent neural networks, thereby enabling the classifiers to learn from subsequent remedial actions. 
     In one implementation, the generating further includes retrieving the exception events and sensed discrepancy information from block-events stored in a pharmaceutical blockchain. 
     In one implementation, the generating further including retrieving the drug identifications from a commercial supplier database. 
     In one implementation, the sensed discrepancies include one or more selected from an empty vial, a discolored contents, a cracked vial, a damaged packaging, a precipitated medicine inside, and a mislabeled vial. 
     In one implementation, the exception events are select from a set of missing pill bottle, an adulterated substance, allergic reaction, a delivery not made, and a patient sick or dead. 
     In one implementation, the remedial actions are selected from a set of instruct user to capture an image, record a sound or scan a bar code, prompt user with instructions, submit a regulatory report, notify an interested third party, and order more substance. 
     In one implementation, the drug categories are selected from a set of opioids, injectable, OTC, prescription, antibiotic, steroid, antihistamine, capsule, tablet, vaccine, and nuclear. 
     In one implementation, the drug classifier neural networks and the exception classifier neural networks are recursive neural networks (RNN) based on long short term memory (LSTM). 
     In one implementation, the drug classifier neural networks and the exception classifier neural networks are trained using a combination of current exception events and additional noise data. 
     In one implementation, the method also includes generating in the training data set, images of the drugs in unadulterated and adulterated form; applying a multilayer convolution and pooling processor and producing reduced dimensionality images from the images of the drugs; training a first set of convolutional neural networks using the reduced dimensionality images and ground truth data indicating whether the images correspond to adulterated drugs or unadulterated drugs. 
     In another alternative implementation, we disclose a method of recognizing discrepancies in drug images in adulterated and unadulterated states and to trigger applications that take remedial actions on a data processor with a target architecture. The method includes applying a multilayer convolution to a plurality of images of drugs and pooling processor and producing reduced dimensionality images, including first and second reduced dimensionality images, from the plurality of drug images including a drug image of the drug in an adulterated state and a drug image of the drug in an unadulterated state. The method can also include processing a pair of first and second reduced dimensionality images using a first neural network to produce estimated classification parameters, using pairs of first and second reduced dimensionality images, estimated classification parameters for the first and second reduced dimensionality images, image data for presentation, and labeled ground truth conclusions indicating whether the classification parameters correspond to a drug in an adulterated state or a drug in an unadulterated state. The method also includes saving the parameters in a tangible machine readable memory for use in drug image recognition. 
     In one implementation, the parameters are selected from a set of color, shape, size, markings, texture. 
     In one implementation, the method further includes capturing drug images of drugs in an adulterated state and in an unadulterated state. 
     In a further alternative implementation, we disclose a method of preparing sample pharmaceutical regulatory compliance for training of neural network systems on a data processor with a target architecture. The method includes accessing in regulatory agency reporting system a plurality of reports with parameters that specify: type of report; incident number provided by a regulatory authority; date of initial notification to the regulatory authority; date company determined product was illegitimate; classification of notification; name of product as it appears on the label; primary ingredients; drug use selected from a set of human, and other; drug description; strength of drug; dosage form; quantity; national drug code number; serial number; lot number; expiration date; for notification, description of event/issue; other reports submitted; company name and address; company category; unique facility number; and contact information. The method can also include generating between 50,000 and 1 billion exception event simulations, each simulation labeled with 5 to 15 selected parameters, including a drug identification. Saving the simulated exception events with labelled ground truth parameters indicating at least remedial events to be triggered for use in training a neural network in a pharmaceutical regulatory compliance system is also part of the method. 
     In one implementation, the type of report is selected from a set of initial notification, follow-up notification, and request for termination. 
     In one implementation, classification of notification is selected from a set of counterfeit, diverted, stolen, intentional adulteration, unfit for distribution, and fraudulent transaction. 
     In one implementation, the drug description is selected from a set of finished prescription drug, vaccine, plasma derivative, including one of coagulation factors, immunoglobulins, albumin, allergenic, including standardized and non-standardized, and multiple. 
     In one implementation, dosage form is selected from a set of tablet, capsule, aerosol, oral liquid, sublingual, injectable, topical, suppository, other, and multiple. 
     In one implementation, other reports is selected from a set of filed alert report, a biological product deviation report, a medical-watch report, none, and other. 
     In one implementation, category is selected from a set of manufacturer, wholesale distributor, dispenser, and repackager. 
     In one implementation, the method further includes accessing additional parameters stored in a commercial supplier database; and using the additional parameters to generate the simulations. 
     In another alternative implementation, we disclose a method of securing clinical trial data on a data processor with a target architecture. The method includes receiving a request to manipulate clinical trial information in block-level clinical trial structures stored to a blockchain. Determining whether the request is made by a participant in a clinical trial or a scientist conducting a clinical trial can also be part of the method. The method also includes permitting access to the participant of a subset of the clinical trial information suitable for the participant, otherwise permitting access to the scientist of a different subset of the clinical trial information suitable for the scientist. 
     In one implementation, the request is a request to enter patient data. The method also includes locating a block on the chain in which the patient data relates; determining whether the request is authorized under a smart contract governing the use of the clinical trial blockchain; and adding the patient to the clinical trial whenever the request is authorized. 
     In one implementation, the request is a request to delete patient data. The method also includes locating a block on the chain in which the patient data relates; determining whether the request is authorized under a smart contract governing the use of the clinical trial blockchain; and deleting the patient from the clinical trial whenever the request is authorized. 
     In one implementation, the request is a request to order a specific substance for a patient in a clinical trial. The method further includes determining which group a patient is in and delivering correct amount of substance. 
     In one implementation, the method also includes detecting a set of patient parameters after substance administration and gathering it back on the chain. 
     In one implementation, the method also includes mixing artificially generated patient data with real patient data in the block chain. 
     In one implementation, the method also includes detecting and adding longitudinal patient outcomes. 
     In one implementation, the method also includes mixing multiple studies on a single block chain to perform meta-analysis. 
     Use Case 
     Under the US statutes associated with Drug Supply Chain Security Act (DSCSA)/Drug Quality and Security Act (DQSA), wholesalers and dispensers of drugs are required to submit Form FDA 3911 to the FDA, as well as separately notify immediate trading partners, when illegitimate products are discovered. Separate channels are specified for reporting by prescribers and patients, such as MedWatch, the FDA&#39;s safety information and adverse event reporting program. One implementation of a neural network enabled interface server as a blockchain proxy user facilitates mandated reporting, improving speed, ease of use, reliability, and security. As a broader concept, this is an exception handling and root cause analysis system driven by a neural network enabled interface server and blockchain, with significant implications for federal safety and compliance reporting. For example within the drug and healthcare reporting field, this approach could address reporting among both professionals and consumers: FDA: Field Alert Report (FAR), FDA: Biological Product Deviation Report (BPDR), FDA: Form 3500 (Medwatch, voluntary reporting by healthcare professionals, consumers, and patients), FDA: Form 3500A (Medwatch, mandatory reporting by IND reporters, manufacturers, distributors, importers, and user facilities personnel), FDA: Form 3500B (Medwatch, voluntary reporting by consumers), FDA: Reportable Food Registry, FDA: Vaccine Adverse Event Reporting System (VAERS), FDA: Investigative Drug/Gene Research Study Adverse Event Reports, FDA: Potential Tobacco Product Violations Reporting (Form FDA 3779), USDA APHIS Center for Veterinary Biologics Reports, USDA Animal and Plant Health Inspection Service: Adverse Event Reporting, USDA FSIS Electronic Consumer Complaints, DEA Tips, Animal Drug Safety Reporting, Consumer Product Safety Commission Reports, State/local reports: Health Department, Board of Pharmacy, and others. 
     Implementations incorporating machine/barcode reading for faster initiation and better data integrity, neural networks implementing categorization and linking to historical challenges, and blockchain including timestamping, tracking, thereby driving a near-real-time resolution system. Certain implementations enable achieving identification of suspect products and, products with a high risk of illegitimacy. Certain implementations enable achieving notification of illegitimate products and products with a high risk of illegitimacy. 
     Implementations can provide stakeholders the most likely paths to resolve the issue at the micro and macro levels—determining the proper course of action for the specific challenge, while intelligently and selectively broadcasting notifications of events (such as recalls) to relevant subsets of subscribers. Using blockchain, system implementations can generate notifications to parties upstream and downstream via text and/or email and can enable counterparties to both resolve exceptions and link them to related exceptions (thus identifying larger event patterns). 
     One implementation of a neural network enabled interface server works with a mobile device and eliminates the need to transcribe data from the bottle. A neural network enabled interface server implementation will be trained to readily determine whether or not the medicine in question is in a pill form and suggest responses like “missing pills” or “crushed or broken pills” that are germane to that medicine, whereas a liquid medicine will present different choices. 
     Trading partners are not given visibility into all relevant transactions; instead, one implementation employs differential privacy to send reports of similar events. Along with fulfilling the minimum information requirements of FDA Form 3911, one implementation enables the functionality for trading partners to ask extemporaneous questions; one deep learning implementation can employ those questions to ask similar questions in similar situations. 
     One implementation of a neural network enabled interface server is able to gather additional data, flag out-of-spec assets, identify ecosystem-level patterns, and engage in root-cause analysis. Such implementations employ cluster identification, free-form typical input learning, convolutional neural network (CNN), and bad actor identification and others. 
     One implementation can receive photos of barcodes taken by a third party, optical character recognition of the human-readable label, and XML or other machine files with the same information. One implementation provides pill recognition based on publicly available image recognition frameworks. One implementation provides the reporting party with a series of deep learning driven modal screens, enabling participants to accurately and rapidly regulators and counter-parties (“trading partners”) of problems. 
     Other Use Cases 
     Implementations of a block chain trained classifier include drug manufacturers, drug wholesalers, hospitals, and pharmacies doing business in the United States and other countries. Implementations incorporating cluster analysis, root cause, block chain and convolutional neural network as a trained classifier can provide prompt contemporaneous notification, compliance reporting, epidemiology, surveillance, and exception handling. Additional use cases include implementations used for food safety, medical devices, and vaccines. 
     The terms and expressions employed herein are used as terms and expressions of description and not of limitation, and there is no intention, in the use of such terms and expressions, of excluding any equivalents of the features shown and described or portions thereof. In addition, having described certain implementations of the technology disclosed, it will be apparent to those of ordinary skill in the art that other implementations incorporating the concepts disclosed herein can be used without departing from the spirit and scope of the technology disclosed. Accordingly, the described implementations are to be considered in all respects as only illustrative and not restrictive. 
     Legal documents. Lawyers rely heavily on burdensome paper trails and myriad third-party services to track legal filings and handle disclosures. One neural network enabled interface server implementation clusters discrepancies or potential conflicts of interest among various parties, and send notifications to relevant parties. (For example, applying natural language processing [NLP] and clustering analysis to identify business records filed in two separate cases that substantially overlap, or clustering names of interested parties would reveal a scenario where a law firm may be acting for more than one client in separate but related matters. In these cases, the neural network enabled interface server would send notifications to court officials.) 
     Patent filings and lawsuits. Patent trolling has increasingly been used as a means to stifle rather than encourage innovation; over the last several years, Vermont, Nebraska, Minnesota, Wisconsin, and Idaho have all implemented legislation or taken other steps to punish bad faith assertions of patent infringement. By analyzing all patent filings over time, as well as accepting reports of bad faith infringement threats (either submitted by individuals through a web or mobile client, or via machine-to-machine [M2M] reports from court IT systems), one neural network enabled interface server implementation would notify the U.S. Patent Office and other stakeholders of questionable patent filings by bad actors (identified through clustering reports of frivolous lawsuits and performing NLP to identify overly broad or non-specific filings). 
     Financial documents and investments. By analyzing the filings sent to one or more regulators such as the SEC, one neural network enabled interface server implementation identifies and sends notifications regarding discrepancies or unusual correlations among filings—not just to the regulator, but also to a submitter of multiple filings where the discrepancy may be unintended. 
     Anti-money laundering. Under the Bank Secrecy Act of 1970, financial institutions in the United States are obligated to keep records of (and in some cases file reports of) cash purchases of negotiable instruments, as well as report suspicious activity. By performing NLP on Financial Crimes Enforcement Network (FinCEN) submissions and related media, one neural network enabled interface server implementation identifies partial name and account matches, match multi-step transactions, and identifies unusual bursts of activity across a variety of factors, including institution and geography. 
     Import/export and customs. From perishable goods to electronic components, imported and exported goods are covered by a wide range of regulatory and disclosure requirements, with stakeholders including trading partners, customs officials, shipping companies, and state and federal regulators for specific industries. One neural network enabled interface server implementation generates notifications on potential faulty, illegitimate, or illegal products being moved across borders. 
     Food safety. In the United States, food safety is covered by a wide range of agencies, including the USDA (meat and poultry products), FDA (all other foods marketed in interstate commerce), EPA (pesticide products), the National Marine Fisheries Service (seafood inspection and grading), and myriad other agencies as well as state and local regulatory systems. Reporting systems include the aforementioned Medwatch, the Reportable Food Registry, and many other ad hoc approaches such as call centers. By funneling these reports (including geographies, food consumed, and medical symptoms) into the blockchain, either directly or through machine-to-machine (M2M) connections, one neural network enabled interface server implementation identifies clusters across various reports arising from potentially related instances, and sends notifications to appropriate authorities. By leveraging user-submitted images (e.g. of food labels and spoilage) and convoluted neural networks, one neural network enabled interface server implementation generates conclusions and deploy notifications to the relevant health authorities. 
     Diamonds. The prevalence of blood diamonds—diamonds mined in war zones and sold to further illegal activities or atrocities —has resulted in the need for various companies throughout the global diamond supply chain to document the provenance of their gems. By clustering variables such as weight and provenance, one neural network enabled interface server implementation identifies suspicious transactions and notify customs officials and industry groups where blood diamonds might be making their way into the legitimate supply chain. 
     Radioactive materials. The global tracking of fissile materials poses a unique challenge to world governments. On a blockchain with smart contracts that adhere to national policies as well as the Treaty on the Non-Proliferation of Nuclear Weapons, this inventory could be tracked in a way that would prevent bad actors from altering records after they have been created. A neural network enabled interface server implementation generates notifications related to unusual activity or suspicious clustering to a predefined national or international overseeing body, such as the Nuclear Regulatory Commission or the International Atomic Energy Agency. 
     This system implementation and other systems disclosed optionally include one or more of the foregoing features. System can also include features described in connection with methods disclosed. In the interest of conciseness, alternative combinations of system features are not individually enumerated. Features applicable to systems, methods, and articles of manufacture are not repeated for each statutory class set of base features. The reader will understand how features identified in this section can readily be combined with base features in other statutory classes. 
     Other implementations may include a non-transitory computer readable storage medium storing instructions executable by a processor to perform actions of the system described above. Each of the features discussed in the particular implementation section for other implementations apply equally to this implementation. As indicated above, all the other features are not repeated here and should be considered repeated by reference. 
     The preceding description is presented to enable the making and use of the technology disclosed. Various modifications to the disclosed implementations will be apparent, and the general principles defined herein may be applied to other implementations and applications without departing from the spirit and scope of the technology disclosed. Thus, the technology disclosed is not intended to be limited to the implementations shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein. The scope of the technology disclosed is defined by the appended claims.