How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Finite-tree multicast loss experiments
Definition
A finite rooted directed tree has root , with all edges directed away from , and a nonempty receiver set consisting of every leaf other than . Every nonroot internal vertex has at least two children. For a vertex , its children are the vertices joined to by an outgoing edge; is the unique edge set on the path from to . The root may have any finite number of children.
A finite probe design is a nonempty finite family , where each receiver set is a nonempty subset of and each probe count is a positive integer. A singleton receiver set is a unicast scheme; a receiver set of size at least two is a multicast scheme. Its used edge set is .
For a link-success parameter vector , each design and probe has mutually independent link-success variables for , with . The same applies in every design and probe (temporal homogeneity). The observed receiver indicator is
For let
The one-probe outcome law is
These probabilities sum to one because the sets partition the finite link-state space and . The complete experiment observes independent outcomes with law for each design, independently across designs. If the data are summarized by counts, is the number of probes in design with outcome , and .
This is a finite statistical experiment: its parameter space is and its sampling law is the finite product of the stated receiver-outcome laws.
Depends on
Used by
Dependency tree · two levels
5 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- R. Cáceres, N. Duffield, J. Horowitz, and D. Towsley, Multicast-Based Inference of Network-Internal Loss Characteristics, IEEE Transactions on Information Theory 45 (1999), 2462–2480 (standard reference, not scraped)
- E. Lawrence, G. Michailidis, and V. N. Nair, Statistical Inverse Problems in Active Network Tomography, IMS Lecture Notes–Monograph Series 54 (2007), 24–44 (standard reference, not scraped)