Efficient Identification of Additive Link Metrics: Theorem Proof and Evaluations

Ananthram Swami; Don Towsley; Kin K. Leung; Liang Ma; Ting He

Efficient Identification of Additive Link Metrics: Theorem Proof and Evaluations

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.12191 v1 pith:TPGX2UET submitted 2020-12-17 cs.NI

Liang Ma , Ting He , Kin K. Leung , Don Towsley , Ananthram Swami This is my paper · ORCID

classification cs.NI

keywords additiveefficientevaluationsidentificationlinkmetricstheoremadditional

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

This is a technical report, containing all the theorem proofs and additional evaluations in paper "Efficient Identification of Additive Link Metrics via Network Tomography" by Liang Ma, Ting He, Kin K. Leung, Don Towsley, and Ananthram Swami, published in IEEE ICDCS, 2013.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

In-sensor 24 classes HAR under 850 Bytes
eess.SP 2025-02 conditional novelty 4.0 of 10

A 24-class HAR model runs on an ISPU sensor in under 850 bytes of stack memory with 85% accuracy.

Pith tools