{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5TX35XAUYCKWICNQW7FTG2FRZH","short_pith_number":"pith:5TX35XAU","canonical_record":{"source":{"id":"1310.2114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-10-08T12:38:36Z","cross_cats_sorted":[],"title_canon_sha256":"06ba82eeb79f802538fce8acfeca30fc5c8be28038af55efe4bbc618f2cac1d9","abstract_canon_sha256":"8d4f5cfceb898fe77c8f29998366f48f94419cab93b580233cc8dcda6fcc255d"},"schema_version":"1.0"},"canonical_sha256":"ecefbedc14c0956409b0b7cb3368b1c9f2f32d79cda8f207fcf87f2c0ca748d7","source":{"kind":"arxiv","id":"1310.2114","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2114","created_at":"2026-05-18T03:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2114v1","created_at":"2026-05-18T03:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2114","created_at":"2026-05-18T03:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"5TX35XAUYCKW","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5TX35XAUYCKWICNQ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5TX35XAU","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5TX35XAUYCKWICNQW7FTG2FRZH","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-10-08T12:38:36Z","cross_cats_sorted":[],"title_canon_sha256":"06ba82eeb79f802538fce8acfeca30fc5c8be28038af55efe4bbc618f2cac1d9","abstract_canon_sha256":"8d4f5cfceb898fe77c8f29998366f48f94419cab93b580233cc8dcda6fcc255d"},"schema_version":"1.0"},"canonical_sha256":"ecefbedc14c0956409b0b7cb3368b1c9f2f32d79cda8f207fcf87f2c0ca748d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:59.314193Z","signature_b64":"Xpehtb2WFEWJ5mixZumaIbOGP7NM+auENNUW2DDcvudCNdor6PjJVHF5s/Z8Cpd9h3J0Lz/KjcjN/4c8GwbSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecefbedc14c0956409b0b7cb3368b1c9f2f32d79cda8f207fcf87f2c0ca748d7","last_reissued_at":"2026-05-18T03:10:59.313411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:59.313411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2114","source_version":1,"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-18T03:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xlh6u3bfDWRHyvsLy148lqQ1ttXmYDjfscvKlkAvR0iCVdmBZzJ5taVZ2I0GkAhG8uzXwo1/qzTFM1+IptrhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:58:59.421835Z"},"content_sha256":"a282e4166876877ea38e6510ee4a0426ac1bf854caaef9da32b5b567dc6ffdab","schema_version":"1.0","event_id":"sha256:a282e4166876877ea38e6510ee4a0426ac1bf854caaef9da32b5b567dc6ffdab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5TX35XAUYCKWICNQW7FTG2FRZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neighbor Joining Plus - algorithm for phylogenetic tree reconstruction with proper nodes assignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Jan P. Radomski, Piotr Plonski","submitted_at":"2013-10-08T12:38:36Z","abstract_excerpt":"Most of major algorithms for phylogenetic tree reconstruction assume that sequences in the analyzed set either do not have any offspring, or that parent sequences can maximally mutate into just two descendants. The graph resulting from such assumptions forms therefore a binary tree, with all the nodes labeled as leaves. However, these constraints are unduly restrictive as there are numerous data sets with multiple offspring of the same ancestors. Here we propose a solution to analyze and visualize such sets in a more intuitive manner. The method reconstructs phylogenetic tree by assigning the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2114","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"},"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-18T03:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"grDGmKN8ZgpMTi05UsF26SuAkeHG++ZRTAHucUx9gn4S/kQfH/1rSnx0nqz+Rj21lW6oTipY0K9PxLMnbT1fAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:58:59.422186Z"},"content_sha256":"c7dab04e4bb6018e604a694365a9f42496229aaa244d2d392d988a60e441b643","schema_version":"1.0","event_id":"sha256:c7dab04e4bb6018e604a694365a9f42496229aaa244d2d392d988a60e441b643"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TX35XAUYCKWICNQW7FTG2FRZH/bundle.json","state_url":"https://pith.science/pith/5TX35XAUYCKWICNQW7FTG2FRZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TX35XAUYCKWICNQW7FTG2FRZH/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-06-05T13:58:59Z","links":{"resolver":"https://pith.science/pith/5TX35XAUYCKWICNQW7FTG2FRZH","bundle":"https://pith.science/pith/5TX35XAUYCKWICNQW7FTG2FRZH/bundle.json","state":"https://pith.science/pith/5TX35XAUYCKWICNQW7FTG2FRZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TX35XAUYCKWICNQW7FTG2FRZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5TX35XAUYCKWICNQW7FTG2FRZH","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":"8d4f5cfceb898fe77c8f29998366f48f94419cab93b580233cc8dcda6fcc255d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-10-08T12:38:36Z","title_canon_sha256":"06ba82eeb79f802538fce8acfeca30fc5c8be28038af55efe4bbc618f2cac1d9"},"schema_version":"1.0","source":{"id":"1310.2114","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2114","created_at":"2026-05-18T03:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2114v1","created_at":"2026-05-18T03:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2114","created_at":"2026-05-18T03:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"5TX35XAUYCKW","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5TX35XAUYCKWICNQ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5TX35XAU","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:c7dab04e4bb6018e604a694365a9f42496229aaa244d2d392d988a60e441b643","target":"graph","created_at":"2026-05-18T03:10:59Z","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":"Most of major algorithms for phylogenetic tree reconstruction assume that sequences in the analyzed set either do not have any offspring, or that parent sequences can maximally mutate into just two descendants. The graph resulting from such assumptions forms therefore a binary tree, with all the nodes labeled as leaves. However, these constraints are unduly restrictive as there are numerous data sets with multiple offspring of the same ancestors. Here we propose a solution to analyze and visualize such sets in a more intuitive manner. The method reconstructs phylogenetic tree by assigning the ","authors_text":"Jan P. Radomski, Piotr Plonski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-10-08T12:38:36Z","title":"Neighbor Joining Plus - algorithm for phylogenetic tree reconstruction with proper nodes assignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2114","kind":"arxiv","version":1},"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:a282e4166876877ea38e6510ee4a0426ac1bf854caaef9da32b5b567dc6ffdab","target":"record","created_at":"2026-05-18T03:10:59Z","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":"8d4f5cfceb898fe77c8f29998366f48f94419cab93b580233cc8dcda6fcc255d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-10-08T12:38:36Z","title_canon_sha256":"06ba82eeb79f802538fce8acfeca30fc5c8be28038af55efe4bbc618f2cac1d9"},"schema_version":"1.0","source":{"id":"1310.2114","kind":"arxiv","version":1}},"canonical_sha256":"ecefbedc14c0956409b0b7cb3368b1c9f2f32d79cda8f207fcf87f2c0ca748d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecefbedc14c0956409b0b7cb3368b1c9f2f32d79cda8f207fcf87f2c0ca748d7","first_computed_at":"2026-05-18T03:10:59.313411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:59.313411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xpehtb2WFEWJ5mixZumaIbOGP7NM+auENNUW2DDcvudCNdor6PjJVHF5s/Z8Cpd9h3J0Lz/KjcjN/4c8GwbSBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:59.314193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2114","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a282e4166876877ea38e6510ee4a0426ac1bf854caaef9da32b5b567dc6ffdab","sha256:c7dab04e4bb6018e604a694365a9f42496229aaa244d2d392d988a60e441b643"],"state_sha256":"468d711bb4825f41b1510c7b8c6b620e83cb7d28511ee63dea527a3c5aed7265"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"up9HG3N9kJ85lsT92TBbTGpG24NReDl76R7WNyOIGgZ8J0LK1b1+Mp9BAN7rfhYztbBARunrSZek9CfUP4a6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:58:59.424175Z","bundle_sha256":"b33365e616cbe558bcbc6c0653ad15fd34814de0f4f0b888ee03efb2382f4913"}}