{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XD7YHCDKPXLNLFKYYW76NRSUUO","short_pith_number":"pith:XD7YHCDK","canonical_record":{"source":{"id":"1004.2073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2010-04-12T22:26:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"98bbab0022c3446af77577cdb1665c0a07ccceb204a8aaf8f42f18acbdaa727d","abstract_canon_sha256":"a5d1499e7237817d7f0f342c7be68898b94cd64380081422c56bdbb71d8e0eb7"},"schema_version":"1.0"},"canonical_sha256":"b8ff83886a7dd6d59558c5bfe6c654a393c461c02f78c9296dcc8f13508d65b0","source":{"kind":"arxiv","id":"1004.2073","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2073","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2073v2","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2073","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"XD7YHCDKPXLN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XD7YHCDKPXLNLFKY","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XD7YHCDK","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XD7YHCDKPXLNLFKYYW76NRSUUO","target":"record","payload":{"canonical_record":{"source":{"id":"1004.2073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2010-04-12T22:26:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"98bbab0022c3446af77577cdb1665c0a07ccceb204a8aaf8f42f18acbdaa727d","abstract_canon_sha256":"a5d1499e7237817d7f0f342c7be68898b94cd64380081422c56bdbb71d8e0eb7"},"schema_version":"1.0"},"canonical_sha256":"b8ff83886a7dd6d59558c5bfe6c654a393c461c02f78c9296dcc8f13508d65b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:16.767279Z","signature_b64":"rtiBlGSCuiNWdgDLqLVo5M6wBOijlIv1llj2JSpjyzllHgRUzt+NUAItQjzsTr64yZXrxP5dlPQgn6JVT1nCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8ff83886a7dd6d59558c5bfe6c654a393c461c02f78c9296dcc8f13508d65b0","last_reissued_at":"2026-05-18T02:24:16.766633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:16.766633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.2073","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fM2WqRT3tz/JoJkqc48NmwaCG3zG2Fv7gbmSAB3OJVnhY6fxeEsSKBzfhTpOFTD63bw5dBKUsqkJtGpYTkAYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:06:50.742106Z"},"content_sha256":"5914a79c0c6e3f2704eafb280ee01a5d0cc9296216ba3529b455b68f25b9b13a","schema_version":"1.0","event_id":"sha256:5914a79c0c6e3f2704eafb280ee01a5d0cc9296216ba3529b455b68f25b9b13a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XD7YHCDKPXLNLFKYYW76NRSUUO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimality of the Neighbor Joining Algorithm and Faces of the Balanced Minimum Evolution Polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"q-bio.PE","authors_text":"David C. Haws, Ruriko Yoshida, Terrell Hodge","submitted_at":"2010-04-12T22:26:03Z","abstract_excerpt":"Balanced minimum evolution (BME) is a statistically consistent distance-based method to reconstruct a phylogenetic tree from an alignment of molecular data. In 2000, Pauplin showed that the BME method is equivalent to optimizing a linear functional over the BME polytope, the convex hull of the BME vectors obtained from Pauplin's formula applied to all binary trees. The BME method is related to the Neighbor Joining (NJ) algorithm, now known to be a greedy optimization of the BME principle. Further, the NJ and BME algorithms have been studied previously to understand when the NJ Algorithm return"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2073","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KKv3lwIlp4gXfumy4cdF0JREnh5jjbfJVaRkdxmPvQwlwFzOimZAwC5APuLPLmrZEsrEJrR94hHG1q76hP0pBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:06:50.742679Z"},"content_sha256":"a458ab248bd680d04d7539cd515eb4477c96415fddca2123968d53942d1e3373","schema_version":"1.0","event_id":"sha256:a458ab248bd680d04d7539cd515eb4477c96415fddca2123968d53942d1e3373"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XD7YHCDKPXLNLFKYYW76NRSUUO/bundle.json","state_url":"https://pith.science/pith/XD7YHCDKPXLNLFKYYW76NRSUUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XD7YHCDKPXLNLFKYYW76NRSUUO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T15:06:50Z","links":{"resolver":"https://pith.science/pith/XD7YHCDKPXLNLFKYYW76NRSUUO","bundle":"https://pith.science/pith/XD7YHCDKPXLNLFKYYW76NRSUUO/bundle.json","state":"https://pith.science/pith/XD7YHCDKPXLNLFKYYW76NRSUUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XD7YHCDKPXLNLFKYYW76NRSUUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XD7YHCDKPXLNLFKYYW76NRSUUO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a5d1499e7237817d7f0f342c7be68898b94cd64380081422c56bdbb71d8e0eb7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2010-04-12T22:26:03Z","title_canon_sha256":"98bbab0022c3446af77577cdb1665c0a07ccceb204a8aaf8f42f18acbdaa727d"},"schema_version":"1.0","source":{"id":"1004.2073","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2073","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2073v2","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2073","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"XD7YHCDKPXLN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XD7YHCDKPXLNLFKY","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XD7YHCDK","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:a458ab248bd680d04d7539cd515eb4477c96415fddca2123968d53942d1e3373","target":"graph","created_at":"2026-05-18T02:24:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Balanced minimum evolution (BME) is a statistically consistent distance-based method to reconstruct a phylogenetic tree from an alignment of molecular data. In 2000, Pauplin showed that the BME method is equivalent to optimizing a linear functional over the BME polytope, the convex hull of the BME vectors obtained from Pauplin's formula applied to all binary trees. The BME method is related to the Neighbor Joining (NJ) algorithm, now known to be a greedy optimization of the BME principle. Further, the NJ and BME algorithms have been studied previously to understand when the NJ Algorithm return","authors_text":"David C. Haws, Ruriko Yoshida, Terrell Hodge","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2010-04-12T22:26:03Z","title":"Optimality of the Neighbor Joining Algorithm and Faces of the Balanced Minimum Evolution Polytope"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2073","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5914a79c0c6e3f2704eafb280ee01a5d0cc9296216ba3529b455b68f25b9b13a","target":"record","created_at":"2026-05-18T02:24:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a5d1499e7237817d7f0f342c7be68898b94cd64380081422c56bdbb71d8e0eb7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2010-04-12T22:26:03Z","title_canon_sha256":"98bbab0022c3446af77577cdb1665c0a07ccceb204a8aaf8f42f18acbdaa727d"},"schema_version":"1.0","source":{"id":"1004.2073","kind":"arxiv","version":2}},"canonical_sha256":"b8ff83886a7dd6d59558c5bfe6c654a393c461c02f78c9296dcc8f13508d65b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8ff83886a7dd6d59558c5bfe6c654a393c461c02f78c9296dcc8f13508d65b0","first_computed_at":"2026-05-18T02:24:16.766633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:16.766633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rtiBlGSCuiNWdgDLqLVo5M6wBOijlIv1llj2JSpjyzllHgRUzt+NUAItQjzsTr64yZXrxP5dlPQgn6JVT1nCAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:16.767279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.2073","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5914a79c0c6e3f2704eafb280ee01a5d0cc9296216ba3529b455b68f25b9b13a","sha256:a458ab248bd680d04d7539cd515eb4477c96415fddca2123968d53942d1e3373"],"state_sha256":"398579a137a9d5d5e7f4dc9fe11735f6191ea141d09e3561109e8c00b7a5a02e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9NbSrxHAQL/6xbg1jAhrm2aA3FnoHNjCT2OvAG1ldzvMswvuDDtuJ0rHyynrLpAsAVXXuFO16taODILHmBzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:06:50.745098Z","bundle_sha256":"e321384c09eb71c251244ee7b4786df80d2cf6aab62dde60618fb935593989eb"}}