{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:MAP2IZ2H5TYOLLGW53XQJZTG3V","short_pith_number":"pith:MAP2IZ2H","schema_version":"1.0","canonical_sha256":"601fa46747ecf0e5acd6eeef04e666dd429625d5fd60e9cbd2fa1a19b9e8e741","source":{"kind":"arxiv","id":"0801.4190","version":2},"attestation_state":"computed","paper":{"title":"Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.DS","math.PR","math.ST","stat.TH"],"primary_cat":"q-bio.PE","authors_text":"Constantinos Daskalakis, Elchanan Mossel, Sebastien Roch","submitted_at":"2008-01-28T05:10:22Z","abstract_excerpt":"We introduce a new phylogenetic reconstruction algorithm which, unlike most previous rigorous inference techniques, does not rely on assumptions regarding the branch lengths or the depth of the tree. The algorithm returns a forest which is guaranteed to contain all edges that are: 1) sufficiently long and 2) sufficiently close to the leaves. How much of the true tree is recovered depends on the sequence length provided. The algorithm is distance-based and runs in polynomial time."},"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":"0801.4190","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2008-01-28T05:10:22Z","cross_cats_sorted":["cs.CE","cs.DS","math.PR","math.ST","stat.TH"],"title_canon_sha256":"4fdef07d3e7a47a11c99924a2ecc0878d08d2196e9243a2e7c14281b92ff7b18","abstract_canon_sha256":"ce7293df05fb6f20b1d1fe477a5d17b89c849f371ee821f102408614f8af53c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:02.497154Z","signature_b64":"LbYNp45aa68oHbB4Ol7F2OnEgyZiy6SimISxmiE2c3JH+anisZhZ8NvnIGrD7iu6VUnz7iJn4f+yiNViL8MEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"601fa46747ecf0e5acd6eeef04e666dd429625d5fd60e9cbd2fa1a19b9e8e741","last_reissued_at":"2026-05-18T04:12:02.496740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:02.496740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.DS","math.PR","math.ST","stat.TH"],"primary_cat":"q-bio.PE","authors_text":"Constantinos Daskalakis, Elchanan Mossel, Sebastien Roch","submitted_at":"2008-01-28T05:10:22Z","abstract_excerpt":"We introduce a new phylogenetic reconstruction algorithm which, unlike most previous rigorous inference techniques, does not rely on assumptions regarding the branch lengths or the depth of the tree. The algorithm returns a forest which is guaranteed to contain all edges that are: 1) sufficiently long and 2) sufficiently close to the leaves. How much of the true tree is recovered depends on the sequence length provided. The algorithm is distance-based and runs in polynomial time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.4190","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0801.4190","created_at":"2026-05-18T04:12:02.496797+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.4190v2","created_at":"2026-05-18T04:12:02.496797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.4190","created_at":"2026-05-18T04:12:02.496797+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAP2IZ2H5TYO","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAP2IZ2H5TYOLLGW","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAP2IZ2H","created_at":"2026-05-18T12:25:57.157939+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/MAP2IZ2H5TYOLLGW53XQJZTG3V","json":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V.json","graph_json":"https://pith.science/api/pith-number/MAP2IZ2H5TYOLLGW53XQJZTG3V/graph.json","events_json":"https://pith.science/api/pith-number/MAP2IZ2H5TYOLLGW53XQJZTG3V/events.json","paper":"https://pith.science/paper/MAP2IZ2H"},"agent_actions":{"view_html":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V","download_json":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V.json","view_paper":"https://pith.science/paper/MAP2IZ2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.4190&json=true","fetch_graph":"https://pith.science/api/pith-number/MAP2IZ2H5TYOLLGW53XQJZTG3V/graph.json","fetch_events":"https://pith.science/api/pith-number/MAP2IZ2H5TYOLLGW53XQJZTG3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V/action/storage_attestation","attest_author":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V/action/author_attestation","sign_citation":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V/action/citation_signature","submit_replication":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V/action/replication_record"}},"created_at":"2026-05-18T04:12:02.496797+00:00","updated_at":"2026-05-18T04:12:02.496797+00:00"}