{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:N6EJO6UVZTHFNCCTKP7MYF7DY3","short_pith_number":"pith:N6EJO6UV","canonical_record":{"source":{"id":"1507.08734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-07-31T02:47:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a09221a20602efdd7027a4ba04dc796b6b06619f4225f5b2766ac7a0ee8fa202","abstract_canon_sha256":"310bd2e6f93b2396d7227f8f4d3715e64749ffdfb5c6a4652dcdedc42049d900"},"schema_version":"1.0"},"canonical_sha256":"6f88977a95ccce56885353fecc17e3c6c294f8468c9bf4a78438541eba59b709","source":{"kind":"arxiv","id":"1507.08734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08734","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08734v1","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08734","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"N6EJO6UVZTHF","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N6EJO6UVZTHFNCCT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N6EJO6UV","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:N6EJO6UVZTHFNCCTKP7MYF7DY3","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-07-31T02:47:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a09221a20602efdd7027a4ba04dc796b6b06619f4225f5b2766ac7a0ee8fa202","abstract_canon_sha256":"310bd2e6f93b2396d7227f8f4d3715e64749ffdfb5c6a4652dcdedc42049d900"},"schema_version":"1.0"},"canonical_sha256":"6f88977a95ccce56885353fecc17e3c6c294f8468c9bf4a78438541eba59b709","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:03.010856Z","signature_b64":"9YBEU2nCOMl6ZXrAJkxVJNaM6nPzz1+yaoy/iNh9irLcFXKFZ1AcVdcWndwBhwD+OD//2hp5oidcXv3FkPVfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f88977a95ccce56885353fecc17e3c6c294f8468c9bf4a78438541eba59b709","last_reissued_at":"2026-05-18T01:36:03.010200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:03.010200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08734","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-18T01:36:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+v84NMOccDgze4IvfhfS29KfYbMnfz1KKLCxLU2Sq5LdR7P2OV1/Oq6AxyNwZeNvlL4p5D8LjqOEi4b1McyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:52:20.221745Z"},"content_sha256":"cd3c4dff8a46d4dc6c08c0304255b6f065c3dc3117501b6f5030ce450d59c15f","schema_version":"1.0","event_id":"sha256:cd3c4dff8a46d4dc6c08c0304255b6f065c3dc3117501b6f5030ce450d59c15f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:N6EJO6UVZTHFNCCTKP7MYF7DY3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic safety radius on Neighbor-Joining method and Balanced Minimal Evolution on small trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"q-bio.PE","authors_text":"Jing Xi, Jin Xie, Ruriko Yoshida, Stefan Forcey","submitted_at":"2015-07-31T02:47:11Z","abstract_excerpt":"A distance-based method to reconstruct a phylogenetic tree with $n$ leaves takes a distance matrix, $n \\times n$ symmetric matrix with $0$s in the diagonal, as its input and reconstructs a tree with $n$ leaves using tools in combinatorics. A safety radius is a radius from a tree metric (a distance matrix realizing a true tree) within which the input distance matrices must all lie in order to satisfy a precise combinatorial condition under which the distance-based method is guaranteed to return a correct tree. A stochastic safety radius is a safety radius under which the distance-based method i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08734","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-18T01:36:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pb+E97AAwZwgIFMVrfbIe6oWPVhuk4kZlaVCAPJRHptqeJuccnvKyD11wsfjNNfabKEjGQIlrx/v7U9q2OvVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:52:20.222461Z"},"content_sha256":"dea8da29b5e719c01cee0d91851e3776d6a67aabb47fd4dfd20da0eb10b339b0","schema_version":"1.0","event_id":"sha256:dea8da29b5e719c01cee0d91851e3776d6a67aabb47fd4dfd20da0eb10b339b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3/bundle.json","state_url":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3/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-25T08:52:20Z","links":{"resolver":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3","bundle":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3/bundle.json","state":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:N6EJO6UVZTHFNCCTKP7MYF7DY3","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":"310bd2e6f93b2396d7227f8f4d3715e64749ffdfb5c6a4652dcdedc42049d900","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-07-31T02:47:11Z","title_canon_sha256":"a09221a20602efdd7027a4ba04dc796b6b06619f4225f5b2766ac7a0ee8fa202"},"schema_version":"1.0","source":{"id":"1507.08734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08734","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08734v1","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08734","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"N6EJO6UVZTHF","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N6EJO6UVZTHFNCCT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N6EJO6UV","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:dea8da29b5e719c01cee0d91851e3776d6a67aabb47fd4dfd20da0eb10b339b0","target":"graph","created_at":"2026-05-18T01:36:03Z","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":"A distance-based method to reconstruct a phylogenetic tree with $n$ leaves takes a distance matrix, $n \\times n$ symmetric matrix with $0$s in the diagonal, as its input and reconstructs a tree with $n$ leaves using tools in combinatorics. A safety radius is a radius from a tree metric (a distance matrix realizing a true tree) within which the input distance matrices must all lie in order to satisfy a precise combinatorial condition under which the distance-based method is guaranteed to return a correct tree. A stochastic safety radius is a safety radius under which the distance-based method i","authors_text":"Jing Xi, Jin Xie, Ruriko Yoshida, Stefan Forcey","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-07-31T02:47:11Z","title":"Stochastic safety radius on Neighbor-Joining method and Balanced Minimal Evolution on small trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08734","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:cd3c4dff8a46d4dc6c08c0304255b6f065c3dc3117501b6f5030ce450d59c15f","target":"record","created_at":"2026-05-18T01:36:03Z","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":"310bd2e6f93b2396d7227f8f4d3715e64749ffdfb5c6a4652dcdedc42049d900","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-07-31T02:47:11Z","title_canon_sha256":"a09221a20602efdd7027a4ba04dc796b6b06619f4225f5b2766ac7a0ee8fa202"},"schema_version":"1.0","source":{"id":"1507.08734","kind":"arxiv","version":1}},"canonical_sha256":"6f88977a95ccce56885353fecc17e3c6c294f8468c9bf4a78438541eba59b709","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f88977a95ccce56885353fecc17e3c6c294f8468c9bf4a78438541eba59b709","first_computed_at":"2026-05-18T01:36:03.010200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:03.010200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9YBEU2nCOMl6ZXrAJkxVJNaM6nPzz1+yaoy/iNh9irLcFXKFZ1AcVdcWndwBhwD+OD//2hp5oidcXv3FkPVfCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:03.010856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd3c4dff8a46d4dc6c08c0304255b6f065c3dc3117501b6f5030ce450d59c15f","sha256:dea8da29b5e719c01cee0d91851e3776d6a67aabb47fd4dfd20da0eb10b339b0"],"state_sha256":"c6331aabed23abd1eb61446e07c40ed40c137e47e6e97859c60562154c3285a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X7edsH5YMJ2jlwVFdoDitLIhLOnHzvFfHvVU3dyKA6ISZT7PoZcRbVprEhGaToigFwLkjs5b6B4e4VYO13MkDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:52:20.226206Z","bundle_sha256":"70798e54606115a77d68c8318a0ee5fb319cdc287ba344cb05b35abff86e5a26"}}