{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GE3FB6Z2X3KBPZA5ULNRK2NVCM","short_pith_number":"pith:GE3FB6Z2","schema_version":"1.0","canonical_sha256":"313650fb3abed417e41da2db1569b51325feb8f7ea32f1dbd0820c0944fe7299","source":{"kind":"arxiv","id":"2408.05058","version":1},"attestation_state":"computed","paper":{"title":"Variational Bayesian Phylogenetic Inference with Semi-implicit Branch Length Distributions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Cheng Zhang, Frederick A. Matsen IV, Marc A. Suchard, Tianyu Xie","submitted_at":"2024-08-09T13:29:08Z","abstract_excerpt":"Reconstructing the evolutionary history relating a collection of molecular sequences is the main subject of modern Bayesian phylogenetic inference. However, the commonly used Markov chain Monte Carlo methods can be inefficient due to the complicated space of phylogenetic trees, especially when the number of sequences is large. An alternative approach is variational Bayesian phylogenetic inference (VBPI) which transforms the inference problem into an optimization problem. While effective, the default diagonal lognormal approximation for the branch lengths of the tree used in VBPI is often insuf"},"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":"2408.05058","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-08-09T13:29:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"53fad79689e6b0e24863c4bb9536c5d7cd92708dd9f8c7aad8be1f5eb0fa77ca","abstract_canon_sha256":"bebd7ed8ef96c43d55dddd27b606e85514772cccd0b5cce03db9bd07eb7d7b1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:56.144222Z","signature_b64":"0nL0shSMzTkZrNXTUifd2q8o79K/7BvS66h94qwRF+q5cDKW7L1eHzoHA+lK1syLR46t0kDOocMUAYLe31FSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"313650fb3abed417e41da2db1569b51325feb8f7ea32f1dbd0820c0944fe7299","last_reissued_at":"2026-07-05T08:53:56.143769Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:56.143769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variational Bayesian Phylogenetic Inference with Semi-implicit Branch Length Distributions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Cheng Zhang, Frederick A. Matsen IV, Marc A. Suchard, Tianyu Xie","submitted_at":"2024-08-09T13:29:08Z","abstract_excerpt":"Reconstructing the evolutionary history relating a collection of molecular sequences is the main subject of modern Bayesian phylogenetic inference. However, the commonly used Markov chain Monte Carlo methods can be inefficient due to the complicated space of phylogenetic trees, especially when the number of sequences is large. An alternative approach is variational Bayesian phylogenetic inference (VBPI) which transforms the inference problem into an optimization problem. While effective, the default diagonal lognormal approximation for the branch lengths of the tree used in VBPI is often insuf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.05058","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/2408.05058/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":"2408.05058","created_at":"2026-07-05T08:53:56.143825+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.05058v1","created_at":"2026-07-05T08:53:56.143825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.05058","created_at":"2026-07-05T08:53:56.143825+00:00"},{"alias_kind":"pith_short_12","alias_value":"GE3FB6Z2X3KB","created_at":"2026-07-05T08:53:56.143825+00:00"},{"alias_kind":"pith_short_16","alias_value":"GE3FB6Z2X3KBPZA5","created_at":"2026-07-05T08:53:56.143825+00:00"},{"alias_kind":"pith_short_8","alias_value":"GE3FB6Z2","created_at":"2026-07-05T08:53:56.143825+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.04730","citing_title":"PhyloVAE: Unsupervised Learning of Phylogenetic Trees via Variational Autoencoders","ref_index":2023,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GE3FB6Z2X3KBPZA5ULNRK2NVCM","json":"https://pith.science/pith/GE3FB6Z2X3KBPZA5ULNRK2NVCM.json","graph_json":"https://pith.science/api/pith-number/GE3FB6Z2X3KBPZA5ULNRK2NVCM/graph.json","events_json":"https://pith.science/api/pith-number/GE3FB6Z2X3KBPZA5ULNRK2NVCM/events.json","paper":"https://pith.science/paper/GE3FB6Z2"},"agent_actions":{"view_html":"https://pith.science/pith/GE3FB6Z2X3KBPZA5ULNRK2NVCM","download_json":"https://pith.science/pith/GE3FB6Z2X3KBPZA5ULNRK2NVCM.json","view_paper":"https://pith.science/paper/GE3FB6Z2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.05058&json=true","fetch_graph":"https://pith.science/api/pith-number/GE3FB6Z2X3KBPZA5ULNRK2NVCM/graph.json","fetch_events":"https://pith.science/api/pith-number/GE3FB6Z2X3KBPZA5ULNRK2NVCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GE3FB6Z2X3KBPZA5ULNRK2NVCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GE3FB6Z2X3KBPZA5ULNRK2NVCM/action/storage_attestation","attest_author":"https://pith.science/pith/GE3FB6Z2X3KBPZA5ULNRK2NVCM/action/author_attestation","sign_citation":"https://pith.science/pith/GE3FB6Z2X3KBPZA5ULNRK2NVCM/action/citation_signature","submit_replication":"https://pith.science/pith/GE3FB6Z2X3KBPZA5ULNRK2NVCM/action/replication_record"}},"created_at":"2026-07-05T08:53:56.143825+00:00","updated_at":"2026-07-05T08:53:56.143825+00:00"}