Abstract: A method extracts explainable corpora embeddings. The method includes constructing a graph with nodes representing terms from a text sequence and edges that include pointwise values generated between pairs of terms. The method further includes generating a rank vector from the graph. Elements of the rank vector correspond to the edges of the graph. A rank value, of the rank values, corresponds to a term from the text sequence. The method further includes selecting the term by comparing the rank vector to a previous rank vector generated for a previous text sequence.

Abstract: A method including transforming metrics, related to a computer network environment, into a digital image including pixels that represent the metrics. The computer network environment initially is load balanced by a first load balancing scheme selected from among load balancing schemes. The method also includes generating a classification of the digital image. The method also includes selecting, based on the classification of the digital image, a selected load balancing scheme from among the load balancing schemes. The method also includes changing the first load balancing scheme to the selected load balancing scheme such that the selected load balancing scheme is applied to the computer network environment.

Abstract: A method optimizes questions to retain engagement. The method includes generating, using a machine learning model, a churn risk from user interaction data. The method includes selecting, when the churn risk satisfies a threshold, a field, from multiple fields, using multiple prediction confidences corresponding to multiple prediction values generated for the multiple fields. The method includes obtaining a prediction value for the field and obtaining a question, corresponding to the field, using the prediction value. The method includes presenting the question and receiving a user input in response to the question.

Abstract: A method converts from compressed language to natural language. The method includes receiving an element string. The element string is in a compressed language format and is extracted from a document in a structured document language. The method includes tokenizing the element string to form multiple element tokens, generating a token set from the element tokens, and generating a name string from multiple token sets. The name string is in a natural language format.

Abstract: A method uses private information with a shared single source of truth. A message is received responsive to adding a first shared block to a shared object ledger of a shared object. The message includes message data. A private block is added to a private object ledger to update a private object. The private block includes private data from the message data. A second shared block is added to the shared object ledger to update the shared object. The second shared block includes shared data from the message data.

Abstract: A method implements verifiable cacheable calculations. A result is calculated. The result is hashed to generate a name of the result. The result is an input of a set of inputs from which the name is generated. Each input of the set of inputs identifies one of a data set, a query, and a function. The result is stored in a cache using the name generated from hashing the result. A request is received to access the result using the name. The result is retrieved from the cache using the name generated from hashing the result corresponding to the input. The result is presented in response to the request.

Abstract: A method secures hash chains via hybrid consensus. A proximate payload for a proximate chain block for a proximate chain is obtained. A first identifier of the proximate chain and the proximate payload are hashed with a hash function to generate a second identifier of the proximate chain. The proximate chain block is added to the proximate chain. The proximate chain block includes the first identifier, the second identifier, and the proximate payload. A request to add the second identifier to a reporting chain is transmitted. A response indicating that the second identifier is incorporated into the reporting chain using the consensus mechanism is received.

Abstract: A method services competing updates from multiple servicing instances. An update message is received by a class of a plurality of classes that service an object. The update message includes an update to the object and an expected version for the object. A version match is determined between the expected version and a current version of the object. When the version match is successful, the update is applied to the object. A response message including the current version of the object is generated. The response message is transmitted. When the update is successfully applied, the response message is transmitted as a success message. When the update is not successfully applied, the response message is transmitted as a failure message.

Abstract: A method for storing object state on hash chains. A block of a hash chain is located with an accessor function. The block includes a field value of a field of an object. Version data is located using the block. The version data identifies a block version of the block. The block version is compared to a function version of the accessor function. The field value from the block is returned when the block version matches the function version. A version matched accessor function is called to return the field value when the block version does not match the function version.

Abstract: A method for using shareable and nested transaction on hash chains includes storing transaction data of a transaction of a hash chain. A lock block is appended to the hash chain. Appending the lock block includes setting a tail block identifier of the hash chain from a preceding tail block of a preceding transaction to the lock block. A data block is appended to the hash chain. Appending the data block includes setting the tail block identifier of the hash chain to the data block. The method further includes removing the transaction data from the transaction without invalidating the hash chain. The method further includes appending an updated data block to the hash chain to update the transaction with updated transaction data.

Abstract: A method for storing object state on hash chains. A read request that includes a received field name is received by an object with a plurality of fields. A field value that corresponds to the received field name is retrieved from a hash chain of the object by traversing the hash chain. A block is found that includes the field value from the plurality of field values that corresponds to the received field name. A response to the read request that includes the field value is generated and transmitted.

Abstract: A method for storing object state on hash chains. A block of a hash chain is located with an accessor function. The block includes a field value of a field of an object. Version data is located using the block. The version data identifies a block version of the block. The block version is compared to a function version of the accessor function. The field value from the block is returned when the block version matches the function version. A version matched accessor function is called to return the field value when the block version does not match the function version.

Abstract: A method for storing object state on hash chains. A read request that includes a received field name is received by an object with a plurality of fields. A field value that corresponds to the received field name is retrieved from a hash chain of the object by traversing the hash chain. A block is found that includes the field value from the plurality of field values that corresponds to the received field name. A response to the read request that includes the field value is generated and transmitted.

Abstract: A method for message management is disclosed. The method includes: deriving, by a first subscriber node (SN), a secret value associated with a publisher node (PN); generating, by the first SN, a first expected sequence number using a one-way function and the secret value; receiving, by the first SN, a first publisher message generated by the PN and including a first sequence number; validating, by the first SN, the first publisher message by comparing the first sequence number with the first expected sequence number; processing, by the first SN, a payload of the first publisher message in response to the first sequence number and the first expected sequence number matching; and generating, by the first SN node, a second expected sequence number using the one-way function, the first sequence number, and the secret value.

Abstract: A method for message management is disclosed. The method includes: deriving, by a first subscriber node (SN), a secret value associated with a publisher node (PN); generating, by the first SN, a first expected sequence number using a one-way function and the secret value; receiving, by the first SN, a first publisher message generated by the PN and including a first sequence number; validating, by the first SN, the first publisher message by comparing the first sequence number with the first expected sequence number; processing, by the first SN, a payload of the first publisher message in response to the first sequence number and the first expected sequence number matching; and generating, by the first SN node, a second expected sequence number using the one-way function, the first sequence number, and the secret value.

Abstract: Techniques for architected data transfer are described. A controller maintains a network information database representing overarching knowledge of the network, such as the underlying communication infrastructure, resource consumption limits, and segment locations. The controller uses the information stored in the network information database to direct transmitters to transfer data segments to receivers in a manner that ensures relatively predictable resource consumption. In one approach, the controller receives a request to transfer data to a receiver. The controller, based on the information contained in the network information database, computes an optimal set of transmitters to participate in the transfer. The controller sends each transmitter in the optimal set an instruction assigning that transmitter to transfer one or more segments of the data to the receiver. Each transmitter, upon receiving the instructions, sends their respectively assigned data segments to the receiver.

Abstract: Techniques for architected data transfer are described. A controller maintains a network information database representing overarching knowledge of the network, such as the underlying communication infrastructure, resource consumption limits, and segment locations. The controller uses the information stored in the network information database to direct transmitters to transfer data segments to receivers in a manner that ensures relatively predictable resource consumption. In one approach, the controller receives a request to transfer data to a receiver. The controller, based on the information contained in the network information database, computes an optimal set of transmitters to participate in the transfer. The controller sends each transmitter in the optimal set an instruction assigning that transmitter to transfer one or more segments of the data to the receiver. Each transmitter, upon receiving the instructions, sends their respectively assigned data segments to the receiver.

Abstract: Techniques for architected data transfer are described. A controller maintains a network information database representing overarching knowledge of the network, such as the underlying communication infrastructure, resource consumption limits, and segment locations. The controller uses the information stored in the network information database to direct transmitters to transfer data segments to receivers in a manner that ensures relatively predictable resource consumption. In one approach, the controller receives a request to transfer data to a receiver. The controller, based on the information contained in the network information database, computes an optimal set of transmitters to participate in the transfer. The controller sends each transmitter in the optimal set an instruction assigning that transmitter to transfer one or more segments of the data to the receiver. Each transmitter, upon receiving the instructions, sends their respectively assigned data segments to the receiver.

Abstract: Techniques for architected data transfer are described. A controller maintains a network information database representing overarching knowledge of the network, such as the underlying communication infrastructure, resource consumption limits, and segment locations. The controller uses the information stored in the network information database to direct transmitters to transfer data segments to receivers in a manner that ensures relatively predictable resource consumption. In one approach, the controller receives a request to transfer data to a receiver. The controller, based on the information contained in the network information database, computes an optimal set of transmitters to participate in the transfer. The controller sends each transmitter in the optimal set an instruction assigning that transmitter to transfer one or more segments of the data to the receiver. Each transmitter, upon receiving the instructions, sends their respectively assigned data segments to the receiver.

Abstract: A method for re-routing a request in a distributed system, that includes sending the request for an originating object, receiving the request at a root node of the originating object, determining whether the root node comprises a first forwarding pointer associated with the originating object, determining a first target object using the first forwarding pointer, if the first forwarding pointer is associated with the originating object, and re-routing the request to the first target object, wherein the distributed system implements an overlay network for message delivery.