{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ","short_pith_number":"pith:YZ2QGFGR","schema_version":"1.0","canonical_sha256":"c6750314d1e90d9101a88a93c7953ece70ad2a9067ed80f7b21470ad7f98ce8d","source":{"kind":"arxiv","id":"2501.13208","version":1},"attestation_state":"computed","paper":{"title":"Likelihood-Based Root State Reconstruction on a Tree: Sensitivity to Parameters and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Allan Sly, David Clancy Jr., Hanbaek Lyu, Sebastien Roch","submitted_at":"2025-01-22T20:44:43Z","abstract_excerpt":"We consider a broadcasting problem on a tree where a binary digit (e.g., a spin or a nucleotide's purine/pyrimidine type) is propagated from the root to the leaves through symmetric noisy channels on the edges that randomly flip the state with edge-dependent probabilities. The goal of the reconstruction problem is to infer the root state given the observations at the leaves only. Specifically, we study the sensitivity of maximum likelihood estimation (MLE) to uncertainty in the edge parameters under this model, which is also known as the Cavender-Farris-Neyman (CFN) model. Our main result show"},"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":"2501.13208","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-01-22T20:44:43Z","cross_cats_sorted":[],"title_canon_sha256":"d740cbf4ca7b80874847bec5481cdcba00c79655e689d58c8d9e426ccb49ec9e","abstract_canon_sha256":"b14c4d3d7aef368193e28f86831e75eaf83385c3c4d39827cb89dc54217f38a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:25.059809Z","signature_b64":"y09c93H+LNhHaK/vueyLCmn/VUZiJiffHmLbOt9m165A6izCO4ICiSoLunh7E7ZocQIxiCSiMTYKl/746UdLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6750314d1e90d9101a88a93c7953ece70ad2a9067ed80f7b21470ad7f98ce8d","last_reissued_at":"2026-07-05T10:04:25.059342Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:25.059342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Likelihood-Based Root State Reconstruction on a Tree: Sensitivity to Parameters and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Allan Sly, David Clancy Jr., Hanbaek Lyu, Sebastien Roch","submitted_at":"2025-01-22T20:44:43Z","abstract_excerpt":"We consider a broadcasting problem on a tree where a binary digit (e.g., a spin or a nucleotide's purine/pyrimidine type) is propagated from the root to the leaves through symmetric noisy channels on the edges that randomly flip the state with edge-dependent probabilities. The goal of the reconstruction problem is to infer the root state given the observations at the leaves only. Specifically, we study the sensitivity of maximum likelihood estimation (MLE) to uncertainty in the edge parameters under this model, which is also known as the Cavender-Farris-Neyman (CFN) model. Our main result show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13208","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.13208/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.13208","created_at":"2026-07-05T10:04:25.059395+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.13208v1","created_at":"2026-07-05T10:04:25.059395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13208","created_at":"2026-07-05T10:04:25.059395+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZ2QGFGR5EGZ","created_at":"2026-07-05T10:04:25.059395+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZ2QGFGR5EGZCANI","created_at":"2026-07-05T10:04:25.059395+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZ2QGFGR","created_at":"2026-07-05T10:04:25.059395+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.17622","citing_title":"Likelihood landscape of binary latent model on a tree","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ","json":"https://pith.science/pith/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ.json","graph_json":"https://pith.science/api/pith-number/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ/graph.json","events_json":"https://pith.science/api/pith-number/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ/events.json","paper":"https://pith.science/paper/YZ2QGFGR"},"agent_actions":{"view_html":"https://pith.science/pith/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ","download_json":"https://pith.science/pith/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ.json","view_paper":"https://pith.science/paper/YZ2QGFGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.13208&json=true","fetch_graph":"https://pith.science/api/pith-number/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ/action/storage_attestation","attest_author":"https://pith.science/pith/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ/action/author_attestation","sign_citation":"https://pith.science/pith/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ/action/citation_signature","submit_replication":"https://pith.science/pith/YZ2QGFGR5EGZCANIRKJ4PFJ6ZZ/action/replication_record"}},"created_at":"2026-07-05T10:04:25.059395+00:00","updated_at":"2026-07-05T10:04:25.059395+00:00"}