{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:N6EJO6UVZTHFNCCTKP7MYF7DY3","short_pith_number":"pith:N6EJO6UV","schema_version":"1.0","canonical_sha256":"6f88977a95ccce56885353fecc17e3c6c294f8468c9bf4a78438541eba59b709","source":{"kind":"arxiv","id":"1507.08734","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.08734","created_at":"2026-05-18T01:36:03.010304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08734v1","created_at":"2026-05-18T01:36:03.010304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08734","created_at":"2026-05-18T01:36:03.010304+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6EJO6UVZTHF","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6EJO6UVZTHFNCCT","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6EJO6UV","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3","json":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3.json","graph_json":"https://pith.science/api/pith-number/N6EJO6UVZTHFNCCTKP7MYF7DY3/graph.json","events_json":"https://pith.science/api/pith-number/N6EJO6UVZTHFNCCTKP7MYF7DY3/events.json","paper":"https://pith.science/paper/N6EJO6UV"},"agent_actions":{"view_html":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3","download_json":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3.json","view_paper":"https://pith.science/paper/N6EJO6UV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08734&json=true","fetch_graph":"https://pith.science/api/pith-number/N6EJO6UVZTHFNCCTKP7MYF7DY3/graph.json","fetch_events":"https://pith.science/api/pith-number/N6EJO6UVZTHFNCCTKP7MYF7DY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3/action/storage_attestation","attest_author":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3/action/author_attestation","sign_citation":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3/action/citation_signature","submit_replication":"https://pith.science/pith/N6EJO6UVZTHFNCCTKP7MYF7DY3/action/replication_record"}},"created_at":"2026-05-18T01:36:03.010304+00:00","updated_at":"2026-05-18T01:36:03.010304+00:00"}