The Setting
A displaced-window observation retains side reports together with observations at the leaves of a deterministic window tree. The side reports specify which orientation bits are revealed. A common decoder turns the reported emissions into a binary word whose length is the surviving length of the complete trace.
Write , with ; all slot and child indices are zero-based. A finite probability law on a finite set is a nonnegative mass function with .✦ For finite laws , a finite family of coordinate laws , conditional laws and a real function on the space of , the product law, coordinate product law, mixture law and joint law, together with expectation, have the formulas in (1). (1)
Paired mechanisms on a finite side-outcome space , with trial slots, are families of first-side laws , second-side laws and common laws , with weights satisfying (2). (2)✦
A paired report is an array in , where is an absent orientation flag and is an ordered side pair.✦ For an orientation , the oriented pair law and hidden pair mass are the functions in (3); the flagged pair mass assigns the hidden mass to an absent flag and the residual oriented mass to a flag revealing .✦ (3)
The paired report law averages flagged masses over a fair orientation.✦ The joint report law is their coordinate product, as in (4). (4)✦
The reported orientation posterior is the binary law in (5). (5)✦
For leaf laws on a finite space , the selected leaf law for an orientation vector is the coordinate product in (6).✦ An orientation rule specifies the leaf orientations from the trial orientations. (6)
The Window Tree
Let be the window, local trial and global trial counts at level , with levels numbered from the bottom. The window trial set , leaf set and filler set identify the emissions of the complete depth- tree. A window assignment in assigns a value in to every trial, including trials below unoccupied children.✦ Their recursive definitions are (7). (7)
A global schedule with children and repetition count labels its trials by . The global trial index is ✦; its pre position is ✦ and its post position is .✦ For a binary vector indexed by the global trials and a child index , the net global displacement is the integer in (8), where bits are identified with their integer values and . (8)✦
The source schedule has the global counts and displacement maps in (9); at level its pre and post positions use and . There are no global trials at level zero.✦ (9)
For this schedule, the source trial, filler and leaf counts are ✦, ✦ and ✦. The window assignment bijection identifies with by reading the coordinate at each trial.✦ Fixed finite enumerations of the index sets give the flattened source assignment bijection .✦ For a paired report , its nested source report flags are the window assignment in obtained by regrouping its flag array through the flattened source assignment bijection.✦
Central Support and Chronology
For optional flags , the window orientation posterior is the coordinate product of the laws over , viewed as a law on .✦ The hidden collection condition , for real , is the recursive count requirement in (10); denote its root local flags, root global flags and child assignments.
Given integer centers , allowed child sets , global displacement maps , an orientation assignment and an incoming displacement , central motif support is the condition in (11).✦ Here is the motif indicator with size parameter , and denote the root local orientations, root global orientations and child assignments of . (11)
For central-support parameters , a flag assignment and an incoming displacement , the noncentral posterior mass is the expectation in (12). For a source flag assignment and an incoming displacement , the source noncentral posterior mass is the noncentral posterior mass with the local source centers and central thirds specified in (12) and the global displacement maps from (9).✦ (12)
A tree emission identifier is an element of , with the bit selecting the first or second member of a trial pair. Given pre and post positions for global trials, the public emission chronology at depth zero consists of the sole leaf.✦ At positive depth it starts with the first emissions of the root local pairs, visits children in increasing order, and ends with the second emissions of the root local pairs.✦ At child the order is: global first emissions assigned to , its first filler, the child’s chronology, global second emissions assigned to , and its second filler.✦ The chronological emission bijection identifies each zero-based position in the public emission chronology with the tree emission identifier at that position.
The source emission enumeration is a bijection from the tree emission identifiers in to the emission slots .✦ For the source pre and post schedule, let be the slot at position of the chronology, whose length is .✦ For an emission slot , the slot outcome space is when is a paired or filler slot and when is a leaf slot.✦ The emission assignment bijection regroups report side pairs, filler outcomes and leaf outcomes into slot outcomes : the paired slots read from , filler slots read , and leaf slots read .✦
For a side decoder , a leaf decoder and an emission slot , the slot decoder is the function that applies at paired and filler slots and at leaf slots.✦ For an indexed family of binary words , write for their concatenation in increasing order of .✦
The Definition
Definition 1. Let be paired mechanisms satisfying (2), let be finite leaf laws, and let be an orientation rule. For a paired report , the joint orientation posterior is the law on given by (13). (13)✦ For paired mechanisms satisfying (2), finite leaf laws and an orientation rule , the canonical source oracle is the joint law on reports and leaf observations in (14). (14)✦ For source window counts , motif size , depth and real parameters , typical source metadata are the reports satisfying (15). (15)✦ For side and leaf decoders , the public source oracle decoder at depth is the function from reports, leaf observations and filler outcomes to binary words specified by (16). (16)✦
In the paper, the result reads: the deterministic window tree reports old leaf observations, side traces, flags and revealed orientation bits with fixed relative identifiers; the common projection applies the old decoders and concatenates in chronological order; given all side metadata, unrevealed bits remain independent and fair, while sibling offsets retain their shared global component; fit requires every interior displacement at level to have absolute value at most ; typical metadata also require at least half the expected hidden counts in every local and global collection and a suitably small conditional fit-failure probability, and the hidden bits are never conditioned on fit.
What Is Checked
These definitions are stated over finite side and leaf laws, paired mechanisms with pointwise common-submass domination, complete window trees, and arbitrary orientation rules and word decoders. The paired report masses in (4) sum to one for any real weights✦; under (2) they are nonnegative.✦ The global indexing map is bijective.✦