{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:X52T3VTWDVM3DB3DFI5QMXEQBE","short_pith_number":"pith:X52T3VTW","schema_version":"1.0","canonical_sha256":"bf753dd6761d59b187632a3b065c900927a3ad5d1dd62f086f9ff8753bd14ae7","source":{"kind":"arxiv","id":"1109.4668","version":1},"attestation_state":"computed","paper":{"title":"Robust estimation of latent tree graphical models: Inferring hidden states with inexact parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","q-bio.PE","stat.TH"],"primary_cat":"math.PR","authors_text":"Allan Sly, Elchanan Mossel, Sebastien Roch","submitted_at":"2011-09-21T22:34:12Z","abstract_excerpt":"Latent tree graphical models are widely used in computational biology, signal and image processing, and network tomography. Here we design a new efficient, estimation procedure for latent tree models, including Gaussian and discrete, reversible models, that significantly improves on previous sample requirement bounds. Our techniques are based on a new hidden state estimator which is robust to inaccuracies in estimated parameters. More precisely, we prove that latent tree models can be estimated with high probability in the so-called Kesten-Stigum regime with $O(log^2 n)$ samples where $n$ is t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1109.4668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-21T22:34:12Z","cross_cats_sorted":["cs.LG","math.ST","q-bio.PE","stat.TH"],"title_canon_sha256":"c9f56a651297aabd358d0c420495ffd34114be8007935a6a25ab12445b5a3b45","abstract_canon_sha256":"8eb7aca8a1c10141384202673447daa43db5003186ced29c881f5a775ea21d2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:33.195138Z","signature_b64":"Ve/CRl/vlU32NA82lta1wX7P/GtIW+57jKM5ZhUDSn9bUkKGbCR9Nj83exoksFO6FZaq4xIdl0q/q0ezD6usCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf753dd6761d59b187632a3b065c900927a3ad5d1dd62f086f9ff8753bd14ae7","last_reissued_at":"2026-05-18T04:12:33.194666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:33.194666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust estimation of latent tree graphical models: Inferring hidden states with inexact parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","q-bio.PE","stat.TH"],"primary_cat":"math.PR","authors_text":"Allan Sly, Elchanan Mossel, Sebastien Roch","submitted_at":"2011-09-21T22:34:12Z","abstract_excerpt":"Latent tree graphical models are widely used in computational biology, signal and image processing, and network tomography. Here we design a new efficient, estimation procedure for latent tree models, including Gaussian and discrete, reversible models, that significantly improves on previous sample requirement bounds. Our techniques are based on a new hidden state estimator which is robust to inaccuracies in estimated parameters. More precisely, we prove that latent tree models can be estimated with high probability in the so-called Kesten-Stigum regime with $O(log^2 n)$ samples where $n$ is t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4668","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.4668","created_at":"2026-05-18T04:12:33.194744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4668v1","created_at":"2026-05-18T04:12:33.194744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4668","created_at":"2026-05-18T04:12:33.194744+00:00"},{"alias_kind":"pith_short_12","alias_value":"X52T3VTWDVM3","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"X52T3VTWDVM3DB3D","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"X52T3VTW","created_at":"2026-05-18T12:26:44.992195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X52T3VTWDVM3DB3DFI5QMXEQBE","json":"https://pith.science/pith/X52T3VTWDVM3DB3DFI5QMXEQBE.json","graph_json":"https://pith.science/api/pith-number/X52T3VTWDVM3DB3DFI5QMXEQBE/graph.json","events_json":"https://pith.science/api/pith-number/X52T3VTWDVM3DB3DFI5QMXEQBE/events.json","paper":"https://pith.science/paper/X52T3VTW"},"agent_actions":{"view_html":"https://pith.science/pith/X52T3VTWDVM3DB3DFI5QMXEQBE","download_json":"https://pith.science/pith/X52T3VTWDVM3DB3DFI5QMXEQBE.json","view_paper":"https://pith.science/paper/X52T3VTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4668&json=true","fetch_graph":"https://pith.science/api/pith-number/X52T3VTWDVM3DB3DFI5QMXEQBE/graph.json","fetch_events":"https://pith.science/api/pith-number/X52T3VTWDVM3DB3DFI5QMXEQBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X52T3VTWDVM3DB3DFI5QMXEQBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X52T3VTWDVM3DB3DFI5QMXEQBE/action/storage_attestation","attest_author":"https://pith.science/pith/X52T3VTWDVM3DB3DFI5QMXEQBE/action/author_attestation","sign_citation":"https://pith.science/pith/X52T3VTWDVM3DB3DFI5QMXEQBE/action/citation_signature","submit_replication":"https://pith.science/pith/X52T3VTWDVM3DB3DFI5QMXEQBE/action/replication_record"}},"created_at":"2026-05-18T04:12:33.194744+00:00","updated_at":"2026-05-18T04:12:33.194744+00:00"}