Abstract: Determining data availability is disclosed, including: performing a data availability challenge with respect to a claimer node to determine whether the claimer node stores at least some elements included in a base layer in a digital tree corresponding to a data entity; and publishing a first set of elements associated with the base layer of the digital tree and the data availability challenge. Furthermore, encoding auditing is disclosed, including: obtaining a first set of elements associated with a base layer of a digital tree corresponding to a data entity; and generating an encoding validity determination of the digital tree based at least in part on whether the first set of elements is usable to recover a second set of elements associated with the base layer of the digital tree.

Abstract: Verifying a set of remotely stored data is disclosed, including: requesting a first element corresponding to a first leaf in a base layer of a digital tree, wherein the digital tree corresponds to a set of remotely stored data; receiving the first element corresponding to the first leaf; and receiving a membership proof comprising a set of elements from one or more layers higher in the digital tree than the base layer of the digital tree, wherein the set of elements comprises a path from the first leaf to a root of the digital tree, wherein the set of elements is dependent on a plurality of additional leaves and wherein verification of the first element corresponding to the first leaf increases a level of confidence in an availability of the plurality of additional leaves.

Abstract: Verifying a set of remotely stored data is disclosed, including: requesting a first element corresponding to a first leaf in a base layer of a digital tree, wherein the digital tree corresponds to a set of remotely stored data; receiving the first element corresponding to the first leaf; and receiving a membership proof comprising a set of elements from one or more layers higher in the digital tree than the base layer of the digital tree, wherein the set of elements comprises a path from the first leaf to a root of the digital tree, wherein the set of elements is dependent on a plurality of additional leaves and wherein verification of the first element corresponding to the first leaf increases a level of confidence in an availability of the plurality of additional leaves.

Abstract: Certain aspects of the present disclosure relate to methods and apparatus for inferring causal relationship between random processes using a temporal learning algorithm. The temporal learning algorithm determines structure of a causal graph with a set of nodes. Input to the nodes may be binary time series (e.g., random processes). The output of the temporal learning algorithm may be a labeled directed graph in which the direction of the connection between each two node indicates causal direction and the strength of connectivity between the nodes indicates intensity of the causal influence. The temporal learning algorithm may iteratively update strength of connections between nodes to track variations in real time.

Abstract: A decentralized approach to peer discovery channel selection is used in some embodiments. In some such embodiments, a mobile wireless terminal supporting a peer to peer signaling protocol, independently determines what channels to use for peer discovery without a central controller indicating the channel or channels to be used. Assuming channels are of a suitable quality, the channels having the best quality need not be identified, with channel selection being made on a predetermined channel ordering basis from those with suitable quality. Different wireless communications devices in the system use the same peer discovery channel selection process making it likely that the same channel or channels will tend to be picked to be used for peer discovery. Other embodiments are directed to implementing a centralized approach to peer discovery channel selection in which a central controller or base station selects channels to be used for peer discovery signaling.

Abstract: A decentralized approach to peer discovery channel selection is used in some embodiments. In some such embodiments, a mobile wireless terminal supporting a peer to peer signaling protocol, independently determines what channels to use for peer discovery without a central controller indicating the channel or channels to be used. Assuming channels are of a suitable quality, the channels having the best quality need not be identified, with channel selection being made on a predetermined channel ordering basis from those with suitable quality. Different wireless communications devices in the system use the same peer discovery channel selection process making it likely that the same channel or channels will tend to be picked to be used for peer discovery. Other embodiments are directed to implementing a centralized approach to peer discovery channel selection in which a central controller or base station selects channels to be used for peer discovery signaling.