{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6BGDFHUW4OFOV2MCFBWSIWHXSO","short_pith_number":"pith:6BGDFHUW","canonical_record":{"source":{"id":"1109.5002","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-23T05:38:55Z","cross_cats_sorted":["cs.CE","cs.DS","math.ST","q-bio.PE","stat.TH"],"title_canon_sha256":"e47dea9e75e0cc2e722b11b5c5e428fed06d0684df6d320192d1065d04c6e04e","abstract_canon_sha256":"50f7fb7b5b111dc0549b5e695ed13fe21c94c27a0fa68e413a30f252daa3bc91"},"schema_version":"1.0"},"canonical_sha256":"f04c329e96e38aeae982286d2458f793a31e0b885cbf6389c308f21283dbfea3","source":{"kind":"arxiv","id":"1109.5002","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5002","created_at":"2026-05-18T03:32:57Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5002v2","created_at":"2026-05-18T03:32:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5002","created_at":"2026-05-18T03:32:57Z"},{"alias_kind":"pith_short_12","alias_value":"6BGDFHUW4OFO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6BGDFHUW4OFOV2MC","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6BGDFHUW","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6BGDFHUW4OFOV2MCFBWSIWHXSO","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5002","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-23T05:38:55Z","cross_cats_sorted":["cs.CE","cs.DS","math.ST","q-bio.PE","stat.TH"],"title_canon_sha256":"e47dea9e75e0cc2e722b11b5c5e428fed06d0684df6d320192d1065d04c6e04e","abstract_canon_sha256":"50f7fb7b5b111dc0549b5e695ed13fe21c94c27a0fa68e413a30f252daa3bc91"},"schema_version":"1.0"},"canonical_sha256":"f04c329e96e38aeae982286d2458f793a31e0b885cbf6389c308f21283dbfea3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:57.240996Z","signature_b64":"kWFLoQM4qg0MgPt8wJ6dtezUqd9+G7PLyVNES+Utsd9iC8gA7LCnn7FG66MT2AGZnBWgfmLEZC92UerllxGrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f04c329e96e38aeae982286d2458f793a31e0b885cbf6389c308f21283dbfea3","last_reissued_at":"2026-05-18T03:32:57.240222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:57.240222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5002","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-18T03:32:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6QRn0a5H0HiRPPSK6bN2ZeW432lw8iIzNd8k15ji/V+MpD8/uhDG4QgWsHz982eUB2Gto3oxW+ARr+JthdyWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T22:17:38.723227Z"},"content_sha256":"29203e506e22d4e9bb9461767d97749d865e99faadfe06095743b535b48559e2","schema_version":"1.0","event_id":"sha256:29203e506e22d4e9bb9461767d97749d865e99faadfe06095743b535b48559e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6BGDFHUW4OFOV2MCFBWSIWHXSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.DS","math.ST","q-bio.PE","stat.TH"],"primary_cat":"math.PR","authors_text":"Constantinos Daskalakis, Sebastien Roch","submitted_at":"2011-09-23T05:38:55Z","abstract_excerpt":"We present an efficient phylogenetic reconstruction algorithm allowing insertions and deletions which provably achieves a sequence-length requirement (or sample complexity) growing polynomially in the number of taxa. Our algorithm is distance-based, that is, it relies on pairwise sequence comparisons. More importantly, our approach largely bypasses the difficult problem of multiple sequence alignment."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5002","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-18T03:32:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lORbcEZRctoJh2OYKqFD65pyvlyukJQsmrtmQ+7Q5IPqW25cVupKUdgU9+87tJivC71x/N3Wi5BcwhGy6gYQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T22:17:38.723936Z"},"content_sha256":"0f7c70b7e31e25293e6c28e54e6cfb1c6b06edd1be691e8524a7b39902dbe0db","schema_version":"1.0","event_id":"sha256:0f7c70b7e31e25293e6c28e54e6cfb1c6b06edd1be691e8524a7b39902dbe0db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BGDFHUW4OFOV2MCFBWSIWHXSO/bundle.json","state_url":"https://pith.science/pith/6BGDFHUW4OFOV2MCFBWSIWHXSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BGDFHUW4OFOV2MCFBWSIWHXSO/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-24T22:17:38Z","links":{"resolver":"https://pith.science/pith/6BGDFHUW4OFOV2MCFBWSIWHXSO","bundle":"https://pith.science/pith/6BGDFHUW4OFOV2MCFBWSIWHXSO/bundle.json","state":"https://pith.science/pith/6BGDFHUW4OFOV2MCFBWSIWHXSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BGDFHUW4OFOV2MCFBWSIWHXSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6BGDFHUW4OFOV2MCFBWSIWHXSO","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":"50f7fb7b5b111dc0549b5e695ed13fe21c94c27a0fa68e413a30f252daa3bc91","cross_cats_sorted":["cs.CE","cs.DS","math.ST","q-bio.PE","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-23T05:38:55Z","title_canon_sha256":"e47dea9e75e0cc2e722b11b5c5e428fed06d0684df6d320192d1065d04c6e04e"},"schema_version":"1.0","source":{"id":"1109.5002","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5002","created_at":"2026-05-18T03:32:57Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5002v2","created_at":"2026-05-18T03:32:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5002","created_at":"2026-05-18T03:32:57Z"},{"alias_kind":"pith_short_12","alias_value":"6BGDFHUW4OFO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6BGDFHUW4OFOV2MC","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6BGDFHUW","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:0f7c70b7e31e25293e6c28e54e6cfb1c6b06edd1be691e8524a7b39902dbe0db","target":"graph","created_at":"2026-05-18T03:32:57Z","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 present an efficient phylogenetic reconstruction algorithm allowing insertions and deletions which provably achieves a sequence-length requirement (or sample complexity) growing polynomially in the number of taxa. Our algorithm is distance-based, that is, it relies on pairwise sequence comparisons. More importantly, our approach largely bypasses the difficult problem of multiple sequence alignment.","authors_text":"Constantinos Daskalakis, Sebastien Roch","cross_cats":["cs.CE","cs.DS","math.ST","q-bio.PE","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-23T05:38:55Z","title":"Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5002","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:29203e506e22d4e9bb9461767d97749d865e99faadfe06095743b535b48559e2","target":"record","created_at":"2026-05-18T03:32:57Z","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":"50f7fb7b5b111dc0549b5e695ed13fe21c94c27a0fa68e413a30f252daa3bc91","cross_cats_sorted":["cs.CE","cs.DS","math.ST","q-bio.PE","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-23T05:38:55Z","title_canon_sha256":"e47dea9e75e0cc2e722b11b5c5e428fed06d0684df6d320192d1065d04c6e04e"},"schema_version":"1.0","source":{"id":"1109.5002","kind":"arxiv","version":2}},"canonical_sha256":"f04c329e96e38aeae982286d2458f793a31e0b885cbf6389c308f21283dbfea3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f04c329e96e38aeae982286d2458f793a31e0b885cbf6389c308f21283dbfea3","first_computed_at":"2026-05-18T03:32:57.240222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:57.240222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kWFLoQM4qg0MgPt8wJ6dtezUqd9+G7PLyVNES+Utsd9iC8gA7LCnn7FG66MT2AGZnBWgfmLEZC92UerllxGrAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:57.240996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5002","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29203e506e22d4e9bb9461767d97749d865e99faadfe06095743b535b48559e2","sha256:0f7c70b7e31e25293e6c28e54e6cfb1c6b06edd1be691e8524a7b39902dbe0db"],"state_sha256":"c213e8e91851d1c5eafc2d1ad4c74a1070d0da872bff1685b6a6d5c5f1b7a517"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wPzjNfNjRiMaAzteYt7lowc0ZyvGzjWV03X9ZQZohwVJlUUrU4dWB99EfXfo4rMmFw8T3vBySHcSAMMylsYdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T22:17:38.727679Z","bundle_sha256":"e30fbf9d85eeaa4c043b6e976e5b01ed3c54f46682142d0b3eedce7c91f7a3f6"}}