{"as_of":"2026-08-07T09:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d65a867d732aa0d16f8be82cee401c16d15c2e9e2cb14927742a4203f715fbf3","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T12:20:43.699451Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.22038/citation-record","integrity":"/paper/2507.22038/integrity","json":"/paper/2507.22038/citation-record.json","paper":"/paper/2507.22038"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1401.0579","last_updated":"2014-01-03T02:52:17Z","snapshot_observed_at":"2026-07-06T03:32:23.116729Z","submitted_at":"2014-01-03T02:52:17Z","title":"More Algorithms for Provable Dictionary Learning","version":1},"cited_work":{"arxiv_id":"1401.0579","doi":null,"metadata_source":"pith","pith_arxiv_id":"1401.0579","snapshot_observed_at":"2026-08-06T12:20:44.346289Z","title":"More Algorithms for Provable Dictionary Learning","venue":"cs.DS","work_id":"4e42c20c-dbc1-41f8-9eea-be80247fced7","year":2014},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.195811Z"},"links":{"cited_paper":"/paper/1401.0579","citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:652759da17ffe5ea1786c39f4e12849ef08537bb348262a6e65a2262997f0e4e","observation_id":"627f97a2-97b9-47af-b498-94f20d7ca501","resolution":{"observed_at":"2026-08-06T12:20:44.353968Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:46.379294Z","title":"Subgradient descent learns orthogonal dictionaries","venue":null,"work_id":"b1f755f9-4636-4713-9296-ff02357aa1ed","year":2019},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.203940Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:41a81d2418c2e6a3e41d7bbfd9bb1b97c94c249e061f308ccb191da7d187153f","observation_id":"33ef1201-6606-4ff5-9f2f-baec9d486ca0","resolution":{"observed_at":"2026-08-06T12:20:46.392566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/biomet/54.3-4.357","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:43.997079Z","title":null,"venue":null,"work_id":"f3573db0-cecb-4151-9d23-1eeb0b3d32ac","year":1967},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.213484Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:523ba8d2ad969788282cb84956a58a07915d49eea27572f6e49c72b885c9a3e8","observation_id":"fb2ad38b-29c4-48ff-a5c1-5db2e3e086ad","resolution":{"observed_at":"2026-08-06T12:20:44.007080Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:46.332598Z","title":"and Tetruashvili, L","venue":null,"work_id":"5c725c47-c015-4c6f-8e8b-a2da2bd8df0d","year":2013},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.232435Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:f98121e77ae9ed47bebbdcf2813f0708e1ae56e4806bb9217bddc48e03469861","observation_id":"eea6e313-b58b-4ec0-b9c5-05fe3aed8b90","resolution":{"observed_at":"2026-08-06T12:20:46.347400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:46.281283Z","title":"M., Ruiz, J., and Zagrebnov, V","venue":null,"work_id":"b11457d0-7b17-41fc-b063-e4d9314ec215","year":1995},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.245605Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:25bd4e4f274cf3efe6b8173b3a5ee1d1d17bc87ff79a3fcf40cfc28a2dde19c7","observation_id":"a6d8e225-d656-42d1-b3c2-6d25c9e3533b","resolution":{"observed_at":"2026-08-06T12:20:46.297363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:46.238098Z","title":"The K esten- S tigum reconstruction bound is tight for roughly symmetric binary channels","venue":null,"work_id":"e7b41ab4-b0b5-4f93-9e6b-43fc3f9da6dc","year":2006},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.256365Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:220a3a99d8379bd0be2e8d183b31d70a41deabfd5f16a6a6c0f391e1932d1757","observation_id":"dd917c1f-079c-4c30-8839-87f62c6040fa","resolution":{"observed_at":"2026-08-06T12:20:46.250924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:46.197080Z","title":null,"venue":null,"work_id":"3e7ff5d9-e01d-4758-9637-fe4ba06a7bf0","year":2013},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.268086Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:fb8772cdd5466f8759f64dadeda9fa85a4492a1e9daaf137ed98e38872e6401f","observation_id":"94850acc-9622-4017-842e-1b99abe24f94","resolution":{"observed_at":"2026-08-06T12:20:46.210836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:46.161250Z","title":null,"venue":null,"work_id":"41105223-a418-457f-8d7b-4829884bd687","year":1978},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.282420Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:2dcf2751e9758417fe0e8901ae6103d48848c93f056db92a62096b1da697207a","observation_id":"adb4cbac-ca3d-43d2-bc4d-f51fab5692a9","resolution":{"observed_at":"2026-08-06T12:20:46.169712Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:46.119650Z","title":"and Chen, Y","venue":null,"work_id":"d8e51114-b9b0-4c82-b10a-ea65e8fd6a84","year":2019},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.291469Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:b15ccf7299ba034ae7336a8bd664bb9212ae9ad63a5d3db85a2aece6702387ad","observation_id":"56e15cd2-69e1-49d8-9f65-487be805e62a","resolution":{"observed_at":"2026-08-06T12:20:46.130188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:43.305309Z","title":"M., and Chen, Y","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.305309Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:16460604e5a83f906a32279bb0474fa3fdddea808c74f11b5dfe45f86de59a73","observation_id":"302ac014-a64c-428b-9eb8-c64da5e7feeb","resolution":{"observed_at":"2026-08-06T12:20:43.305309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:46.069569Z","title":"and Tuller, T","venue":null,"work_id":"c1f4d2ee-dc83-4fee-8bf6-8dab7b489b5e","year":2006},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.315720Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:fb0646ca080ba8abc7fbcdcacaa8fdf67af3469638566b138f944dc1b1aeb525","observation_id":"f8e0bf1c-4c26-43cf-b54b-7a3a75b72f45","resolution":{"observed_at":"2026-08-06T12:20:46.083613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.17622","last_updated":"2026-05-20T21:29:21Z","snapshot_observed_at":"2026-07-06T20:27:50.927871Z","submitted_at":"2025-01-29T12:54:55Z","title":"Likelihood landscape of binary latent model on a tree","version":2},"cited_work":{"arxiv_id":"2501.17622","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.17622","snapshot_observed_at":"2026-08-06T12:20:44.135026Z","title":"Likelihood landscape of binary latent model on a tree","venue":"math.ST","work_id":"ae343bff-9ba8-4ab1-a41e-94bd1fcab587","year":2025},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.335791Z"},"links":{"cited_paper":"/paper/2501.17622","citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:0b057e8cb2f2ec047b2794285e9e00873ee26a533c4836044b534c7f88810010","observation_id":"d364c6d0-0df6-4729-a19f-3b0338115183","resolution":{"observed_at":"2026-08-06T12:20:44.148179Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13208","last_updated":"2025-01-22T20:44:43Z","snapshot_observed_at":"2026-07-06T20:24:40.633122Z","submitted_at":"2025-01-22T20:44:43Z","title":"Likelihood-Based Root State Reconstruction on a Tree: Sensitivity to Parameters and Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.13208","snapshot_observed_at":"2026-08-06T12:20:43.344940Z","title":", D., Lyu, H., Roch, S., and Sly, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.344940Z"},"links":{"cited_paper":"/paper/2501.13208","citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:fb9b6d77fb08d36daa4e53702ce387842d42510ad6eb059c27f4e4acd02937fe","observation_id":"1194f764-b0a2-4080-90b9-4380bf97553b","resolution":{"observed_at":"2026-08-06T12:20:43.344940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:46.030601Z","title":"Mathematical M ethods of S tatistics , volume 9 of Princeton Mathematical Series","venue":null,"work_id":"786953ed-c32c-4966-b07f-c70ac141f82b","year":1946},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.362259Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:d8b43e239c66103a75ff26b23900698af775ebc6ba522f3cf886aac0ef73952b","observation_id":"bd385114-3483-4c70-9cda-b5a426665c20","resolution":{"observed_at":"2026-08-06T12:20:46.043075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00440-009-0246-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:43.969014Z","title":"Evolutionary trees and the ising model on the bethe lattice: a proof of steel's conjecture","venue":null,"work_id":"4af380a4-91ef-44ae-bd12-0950927b65eb","year":2011},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.372303Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:6651e16c8618f8a7e927c5267d27a8306326ec176eaafb93df04cb65243a79a5","observation_id":"bc312b8b-6d1c-4249-a27d-d33e080abe50","resolution":{"observed_at":"2026-08-06T12:20:43.978195Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:45.991133Z","title":"Probability: Theory and Examples , volume 49","venue":null,"work_id":"0ebeb77b-ff8d-4bc9-b19e-d9777b08e0a3","year":2019},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.381103Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:146ce283a9b87770c4437d8284f4059a23ac0d89fc2e913b1d2ad66a704bd5f5","observation_id":"60ea41f1-2bb8-49fe-881f-d28930028a09","resolution":{"observed_at":"2026-08-06T12:20:46.002784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:45.963164Z","title":null,"venue":null,"work_id":"a643833c-28e8-4e9e-b8ed-0fbc271e739b","year":1973},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.392060Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:9bdecdac33b27bcd3545de3d66fd7e630dd3d5375510368a1bffd70255b4600a","observation_id":"cb75e776-af0a-4ae0-ba74-f38c6e3782dc","resolution":{"observed_at":"2026-08-06T12:20:45.968483Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:45.931301Z","title":"Evolutionary trees from DNA sequences: A maximum likelihood approach","venue":null,"work_id":"b75ee708-2ad2-4ffa-b622-8713b92b4ab6","year":1981},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.403518Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:4c52c50828480365a68bb21fc42e35cf93de77a95cabf8e1eab81cf446ff4875","observation_id":"1e079d87-cc37-451c-8005-a2de4c8effc2","resolution":{"observed_at":"2026-08-06T12:20:45.938661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:45.901951Z","title":"and Tateno, Y","venue":null,"work_id":"f3a3efde-de1d-4423-b64e-f972407cad75","year":1989},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.419217Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:832db0d01b5d91174361db8b3439db90a927dffcd1af5144e4eb81f90a4e0f28","observation_id":"1dc8c754-81d0-4cad-b08e-43304fb573ba","resolution":{"observed_at":"2026-08-06T12:20:45.910276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:45.862802Z","title":"D., Garrote-L \\'o pez, M., and Shehu, E","venue":null,"work_id":"f2ef634f-1daa-41e0-b4f6-306ccc78c15b","year":2024},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.431185Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:82ed959271731a55254029d8587fea8bb472b05c9612e55fd75232485c0962e5","observation_id":"581a18c0-c02f-49f6-b279-69dcbd3ea06f","resolution":{"observed_at":"2026-08-06T12:20:45.872689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:45.832661Z","title":"and Gascuel, O","venue":null,"work_id":"d0861bae-a339-41fa-9def-59ef82be9d21","year":2003},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.440044Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:8fc9d2b35a6a4c233d0be96f04f970cdfe6fc7a30189ef28b29bb42e21ec6342","observation_id":"41667b00-8a1f-44c4-8764-6cebe8ccc985","resolution":{"observed_at":"2026-08-06T12:20:45.847238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:45.809271Z","title":"New algorithms and methods to estimate maximum-likelihood phylogenies: assessing the performance of PhyML 3.0","venue":null,"work_id":"b3ee3138-29b3-49be-b99d-253bbc7ede62","year":2010},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.455220Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:bdfd26a83b645b0114e51684d005131e821843ba38f7c5aaea3e9f69d3f94f86","observation_id":"f78ef1ba-ff51-44a0-952c-c591ccec5660","resolution":{"observed_at":"2026-08-06T12:20:45.816900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/1266192","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:43.940435Z","title":null,"venue":null,"work_id":"ecd56de6-9d1b-4fc9-931c-b7c473460d5b","year":1967},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.465871Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:dc52fa5c8ac2263567119a386647a50d118826e0f31140c8279c5fe1ab5597fb","observation_id":"5f5519fe-7ca2-487a-a653-fc2df2e5f2d4","resolution":{"observed_at":"2026-08-06T12:20:43.948739Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:45.725428Z","title":"On the extremality of the disordered state for the I sing model on the B ethe lattice","venue":null,"work_id":"3a032531-2336-4bda-8fd9-91df330750ad","year":1996},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.474000Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:ffb3aacaf9b1ef3b397ac4304ac7018b2ba42926696321d3a008a61002575419","observation_id":"3e2eee3c-cd35-4f22-ba09-c982b070e02d","resolution":{"observed_at":"2026-08-06T12:20:45.772596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:45.617704Z","title":"Non-convex optimization for machine learning","venue":null,"work_id":"35ea77be-a5ae-4188-97a2-19e00c2f4a59","year":2017},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.486364Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:8a7ffd13a149961816a396b22d6b8903c829a16d66f21faad35b0dc0d94f512d","observation_id":"329e5b7c-074e-4f95-a795-3048b436654c","resolution":{"observed_at":"2026-08-06T12:20:45.685292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:45.415144Z","title":"Linear convergence of gradient and proximal-gradient methods under the P olyak- ojasiewicz condition","venue":null,"work_id":"0db5f748-2419-4582-9ccc-e1688e532c12","year":2016},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.492852Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:8ae3c21fb63a068f5a8c5309a1579d8334fb03ec81b8dd67f04cadf0c4727f6d","observation_id":"ec00d817-609c-4165-8839-43d5c10f9d6d","resolution":{"observed_at":"2026-08-06T12:20:45.517880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:45.265104Z","title":"and Stigum, B","venue":null,"work_id":"33857001-d7e9-4be3-8662-611d6b3b0326","year":1966},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.501249Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:568d36ad16062f49b3888b8a94e437243a57ed7566a9dbf3ad85b49618a9c070","observation_id":"89380c29-0616-45e2-8690-fe80411a7026","resolution":{"observed_at":"2026-08-06T12:20:45.347884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4939-9761-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:43.899086Z","title":"and Babu, G","venue":null,"work_id":"84a670cc-33ff-47ec-a43d-23ef1380d775","year":2019},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.516463Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:67ff5c449fd23172aadceedc7bfafffb79935b25fda023ece4fe12266b935b5f","observation_id":"dd3c81d5-fa46-4c49-ad94-18af7a86bb8a","resolution":{"observed_at":"2026-08-06T12:20:43.911186Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:45.079136Z","title":"A topological property of real analytic subsets","venue":null,"work_id":"1052859c-84ce-4c65-a034-0b364b7d88e3","year":1963},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.526872Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:a2f8a2986039279f16cf67c1bebc0374fb62fd40aa991e5fe37e7e15caf77a24","observation_id":"a9f12ef2-5462-43a3-8ce3-4740b3f2ba6e","resolution":{"observed_at":"2026-08-06T12:20:45.163328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.965529Z","title":"Implicit regularization in nonconvex statistical estimation: G radient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution","venue":null,"work_id":"4f48fbb9-7c65-4673-ac96-c2d82be757c1","year":2020},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.538934Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:0976724a41682f411c66c2bc3cbae5a2159c08f00d3e82ab055875ce306d8396","observation_id":"61f7d04b-2b42-4758-b38f-844ce91a2c75","resolution":{"observed_at":"2026-08-06T12:20:44.987424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.897555Z","title":"Combinatorial statistics and the sciences","venue":null,"work_id":"62173192-51af-4e21-9222-6752c9ce6901","year":2022},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.548003Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:abfcb505646d0eb68113b09e05b80d56460d6e505992d82f1baf46969057a3f5","observation_id":"54d05b06-5789-410e-b80b-2b52a9286a3a","resolution":{"observed_at":"2026-08-06T12:20:44.926442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.862089Z","title":null,"venue":null,"work_id":"111e1ada-b53d-481e-82af-a0112c957248","year":2012},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.559482Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:ad366ed392ed9df620af34740ea17e11495ee51f6b3672903876b82ab6c8c707","observation_id":"fada1db6-9fe3-4c20-a224-1843e5f12fcc","resolution":{"observed_at":"2026-08-06T12:20:44.873121Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.811923Z","title":"Molecular studies of evolution: a source of novel statistical problems","venue":null,"work_id":"ddf40991-96ad-450a-bf72-a9f2ab58a71a","year":1971},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.570871Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:685f67a0a528682a8086fa83f0b78006d47cf5a058908df3474d826bd47881e6","observation_id":"3c8c1f41-3b1b-4e2f-b976-94d108ea553d","resolution":{"observed_at":"2026-08-06T12:20:44.828427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.766378Z","title":"A., von Haeseler, A., and Minh, B","venue":null,"work_id":"c2012250-810c-4e1b-afcd-21449935ed82","year":2015},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.581195Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:ae45dbc6dbf9a7044e5d94101f99c9fd566709b5584826c174396e68f3d74d40","observation_id":"1d1937f0-0eaf-46e8-a6e7-e676a84082d7","resolution":{"observed_at":"2026-08-06T12:20:44.780708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.725383Z","title":null,"venue":null,"work_id":"9733a1ee-0682-449c-957b-8f0dd4ac9287","year":1963},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.586633Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:230dfb29f9f87b4deb07d2d8ad4337eca58c022562f75fa85ab241bebcb9fecd","observation_id":"8bdaf9b4-08aa-4a6b-81d9-4a6b84b00eb3","resolution":{"observed_at":"2026-08-06T12:20:44.737272Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.692268Z","title":"A short proof that phylogenetic tree reconstruction by maximum likelihood is hard","venue":null,"work_id":"7d097c73-a8bf-4ad9-94d7-47b5bbe0d886","year":2006},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.600205Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:1c404aec66ed349837028dad219998a5172e6f00db5f486b02c0b03905bd645d","observation_id":"bb2ad0f0-5ed5-44a1-8657-da11b229adc0","resolution":{"observed_at":"2026-08-06T12:20:44.703651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:43.607420Z","title":"Modern Discrete Probability: An Essential Toolkit","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.607420Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:d57480c224916e60282ae2a9f57f2a737e9bdb5b041b8ba43e69a6a04727d47d","observation_id":"192368fb-df8f-4f63-a762-c5201b1baa79","resolution":{"observed_at":"2026-08-06T12:20:43.607420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00440-017-0793-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:43.822402Z","title":"and Sly, A","venue":null,"work_id":"0cfc5e22-2fb0-450f-b998-246feade9c2d","year":2017},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.616380Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:8d60485e30994772e2aa794f6c2dc5ea80fa08a4d71c518fdb89c5db5578d21f","observation_id":"a4fdc9ba-c696-4d8c-a799-03a783cf8a43","resolution":{"observed_at":"2026-08-06T12:20:43.833681Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.636944Z","title":"RAxML version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies","venue":null,"work_id":"16c33438-1341-46af-a178-85660de7fd33","year":2014},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.622024Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:18dc1773757720b46ba8728bd2be82b1bbc34080fc72930bf615c0dc2375ff3b","observation_id":"aed6ae32-9ffb-406e-b31c-5e98510e9268","resolution":{"observed_at":"2026-08-06T12:20:44.659148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.587208Z","title":"The maximum likelihood point for a phylogenetic tree is not unique","venue":null,"work_id":"5cdfe414-bc7f-440d-bfcb-6fc09b034116","year":1994},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.629921Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:c0d891d95f993d4582e7b38c14654c5572c44d9464d081fa9a06775cf2e89266","observation_id":"79b8601c-1156-45b8-8dbe-680bd8721f2f","resolution":{"observed_at":"2026-08-06T12:20:44.605293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.542335Z","title":"Phylogeny: Discrete and Random Processes in Evolution","venue":null,"work_id":"26fb339e-eb4a-4d43-ab37-06ba57341c58","year":2016},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.643115Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:0e9ccef0080e3f00f30a1455788011a505ee12d54d18292614fccbe94b6d8017","observation_id":"31edd194-3650-4e10-9323-2ea196d96082","resolution":{"observed_at":"2026-08-06T12:20:44.555848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:43.653316Z","title":"A geometric analysis of phase retrieval","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.653316Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:9f472f90861ae2a9de5809bc97cfcfcaae3db5110d01e678cdaee69aed0bfe3b","observation_id":"ce5ef001-e66d-4acb-b4cb-c3d7383b11cf","resolution":{"observed_at":"2026-08-06T12:20:43.653316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.495701Z","title":null,"venue":null,"work_id":"511fc474-2234-4b71-9a69-5748e0969aab","year":2012},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.659881Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:5e48006e5a2641b6bdada3223d6977b85992cd6b4c5bb81e46ef9f804f18519a","observation_id":"69e5980d-9c23-419f-a3e0-5487f733cf56","resolution":{"observed_at":"2026-08-06T12:20:44.512994Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.454321Z","title":"Note on the consistency of the maximum likelihood estimate","venue":null,"work_id":"fd208602-e929-4840-b393-bb6fe078639b","year":1949},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.668945Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:cc52b9d7be0d9ceb143ac270ac118817d053a852454587f58226871edf5ef235","observation_id":"858ae155-3b97-407b-9a22-c000bc452bc7","resolution":{"observed_at":"2026-08-06T12:20:44.466715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:44.409155Z","title":"Computational Phylogenetics : An Introduction to Designing Methods for Phylogeny Estimation","venue":null,"work_id":"18719402-e586-4f59-952e-574c19d3e9c5","year":2018},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.677672Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:c8bd9baf998c3ac1ef8abf7932a9fd5e7d298894a9626ea8c32cea56ca076c48","observation_id":"5aa2f76f-6880-4e0f-b741-f2b0e6df2784","resolution":{"observed_at":"2026-08-06T12:20:44.425879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.06753","last_updated":"2022-07-08T18:57:15Z","snapshot_observed_at":"2026-08-06T04:32:21.554135Z","submitted_at":"2020-07-14T01:19:15Z","title":"From Symmetry to Geometry: Tractable Nonconvex Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.06753","snapshot_observed_at":"2026-08-06T12:20:43.687911Z","title":"From symmetry to geometry: Tractable nonconvex problems","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.687911Z"},"links":{"cited_paper":"/paper/2007.06753","citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:a6da0fd1372bc19b847a8e52da7ec571340001eefe77a314bc79533376b9685e","observation_id":"ef18c4f6-3cc5-4e7f-837b-443957886621","resolution":{"observed_at":"2026-08-06T12:20:43.687911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:20:43.699451Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.699451Z"},"links":{"citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:e8e0b72447b688d5c9af12cbeae52619e319cb2885ca251281e37567358f22e0","observation_id":"7cf54151-1db0-4d24-b426-0f44e0f4ed13","resolution":{"observed_at":"2026-08-06T12:20:43.699451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","latest_version":1,"primary_category":"stat.CO","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":12,"verified_exact":6,"verified_fuzzy":28},"total_outbound_references":47},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2507.22038."}