{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:MAP2IZ2H5TYOLLGW53XQJZTG3V","short_pith_number":"pith:MAP2IZ2H","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"},"canonical_sha256":"601fa46747ecf0e5acd6eeef04e666dd429625d5fd60e9cbd2fa1a19b9e8e741","source":{"kind":"arxiv","id":"0801.4190","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.4190","created_at":"2026-05-18T04:12:02Z"},{"alias_kind":"arxiv_version","alias_value":"0801.4190v2","created_at":"2026-05-18T04:12:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.4190","created_at":"2026-05-18T04:12:02Z"},{"alias_kind":"pith_short_12","alias_value":"MAP2IZ2H5TYO","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"MAP2IZ2H5TYOLLGW","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"MAP2IZ2H","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:MAP2IZ2H5TYOLLGW53XQJZTG3V","target":"record","payload":{"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"},"canonical_sha256":"601fa46747ecf0e5acd6eeef04e666dd429625d5fd60e9cbd2fa1a19b9e8e741","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"},"source_kind":"arxiv","source_id":"0801.4190","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-18T04:12:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPkMChWPSkN2g10/XYBH847dbpiufPpQEiJhLgXUq0TXqWExbaysB4lf0W9LzLzOs+FXKzFdTV23DwYJccp9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:54:38.663653Z"},"content_sha256":"b629328935634874398c39379d24e2624108b9d73bf4bf0377977f044d741308","schema_version":"1.0","event_id":"sha256:b629328935634874398c39379d24e2624108b9d73bf4bf0377977f044d741308"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:MAP2IZ2H5TYOLLGW53XQJZTG3V","target":"graph","payload":{"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"},"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-18T04:12:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RaRvC7no+gGI82N7Q/PbjK9jKl68cwRH5s16P8Z3Zmmy/0bHI8VWR9UzwGv0YwlJOBjctfwSAU+2Z5YTaRnkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:54:38.664304Z"},"content_sha256":"489fc4f509e5450d7aa218c02c4132c14b60b8eb782655501f3811d50c8d98be","schema_version":"1.0","event_id":"sha256:489fc4f509e5450d7aa218c02c4132c14b60b8eb782655501f3811d50c8d98be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V/bundle.json","state_url":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V/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-24T11:54:38Z","links":{"resolver":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V","bundle":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V/bundle.json","state":"https://pith.science/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAP2IZ2H5TYOLLGW53XQJZTG3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:MAP2IZ2H5TYOLLGW53XQJZTG3V","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":"ce7293df05fb6f20b1d1fe477a5d17b89c849f371ee821f102408614f8af53c3","cross_cats_sorted":["cs.CE","cs.DS","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2008-01-28T05:10:22Z","title_canon_sha256":"4fdef07d3e7a47a11c99924a2ecc0878d08d2196e9243a2e7c14281b92ff7b18"},"schema_version":"1.0","source":{"id":"0801.4190","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.4190","created_at":"2026-05-18T04:12:02Z"},{"alias_kind":"arxiv_version","alias_value":"0801.4190v2","created_at":"2026-05-18T04:12:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.4190","created_at":"2026-05-18T04:12:02Z"},{"alias_kind":"pith_short_12","alias_value":"MAP2IZ2H5TYO","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"MAP2IZ2H5TYOLLGW","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"MAP2IZ2H","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:489fc4f509e5450d7aa218c02c4132c14b60b8eb782655501f3811d50c8d98be","target":"graph","created_at":"2026-05-18T04:12:02Z","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":"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.","authors_text":"Constantinos Daskalakis, Elchanan Mossel, Sebastien Roch","cross_cats":["cs.CE","cs.DS","math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2008-01-28T05:10:22Z","title":"Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.4190","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:b629328935634874398c39379d24e2624108b9d73bf4bf0377977f044d741308","target":"record","created_at":"2026-05-18T04:12:02Z","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":"ce7293df05fb6f20b1d1fe477a5d17b89c849f371ee821f102408614f8af53c3","cross_cats_sorted":["cs.CE","cs.DS","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2008-01-28T05:10:22Z","title_canon_sha256":"4fdef07d3e7a47a11c99924a2ecc0878d08d2196e9243a2e7c14281b92ff7b18"},"schema_version":"1.0","source":{"id":"0801.4190","kind":"arxiv","version":2}},"canonical_sha256":"601fa46747ecf0e5acd6eeef04e666dd429625d5fd60e9cbd2fa1a19b9e8e741","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"601fa46747ecf0e5acd6eeef04e666dd429625d5fd60e9cbd2fa1a19b9e8e741","first_computed_at":"2026-05-18T04:12:02.496740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:02.496740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LbYNp45aa68oHbB4Ol7F2OnEgyZiy6SimISxmiE2c3JH+anisZhZ8NvnIGrD7iu6VUnz7iJn4f+yiNViL8MEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:02.497154Z","signed_message":"canonical_sha256_bytes"},"source_id":"0801.4190","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b629328935634874398c39379d24e2624108b9d73bf4bf0377977f044d741308","sha256:489fc4f509e5450d7aa218c02c4132c14b60b8eb782655501f3811d50c8d98be"],"state_sha256":"9cfcde882a87bb69bf46737653bbd2b79e41bbb12e7f304809e90b6e16e8cdcd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RcgTGAQ64nf423ZhW3rylBwn0m3GwGhpMNhNwSqzLSaUpdYn+ywT41uGrkmpxVc2BSRVtjqAl1VyO5m0K2sUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T11:54:38.667699Z","bundle_sha256":"94ae5c24e9f1525899da66036cf75ca7d5c18bd55cc40f05b8d958eb34e5fb6f"}}