{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TZS3DBTWUYXOUM4NBZHCRDGMUC","short_pith_number":"pith:TZS3DBTW","canonical_record":{"source":{"id":"1205.3532","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2012-05-16T00:25:31Z","cross_cats_sorted":[],"title_canon_sha256":"4c899130fc7ccf95f16ed7b17d97ccfb6bffe4fef4f1cb65a85d2fad24686b88","abstract_canon_sha256":"d9d8c2cae5a923e7111bb922d182c776554349cf295975bc8f08971103fc520f"},"schema_version":"1.0"},"canonical_sha256":"9e65b18676a62eea338d0e4e288ccca09d88f19fdfcb7b04284d8864692eea07","source":{"kind":"arxiv","id":"1205.3532","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3532","created_at":"2026-05-18T03:29:27Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3532v3","created_at":"2026-05-18T03:29:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3532","created_at":"2026-05-18T03:29:27Z"},{"alias_kind":"pith_short_12","alias_value":"TZS3DBTWUYXO","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TZS3DBTWUYXOUM4N","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TZS3DBTW","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TZS3DBTWUYXOUM4NBZHCRDGMUC","target":"record","payload":{"canonical_record":{"source":{"id":"1205.3532","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2012-05-16T00:25:31Z","cross_cats_sorted":[],"title_canon_sha256":"4c899130fc7ccf95f16ed7b17d97ccfb6bffe4fef4f1cb65a85d2fad24686b88","abstract_canon_sha256":"d9d8c2cae5a923e7111bb922d182c776554349cf295975bc8f08971103fc520f"},"schema_version":"1.0"},"canonical_sha256":"9e65b18676a62eea338d0e4e288ccca09d88f19fdfcb7b04284d8864692eea07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:27.573906Z","signature_b64":"GK5w2+XMbIa7G4ovBGayn/c6Syj0GAD5Ui5SqvVXwellWnIzR7e+Z0Q05z7hW2Lc8fRGOIWoIZUBqkG2tEbUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e65b18676a62eea338d0e4e288ccca09d88f19fdfcb7b04284d8864692eea07","last_reissued_at":"2026-05-18T03:29:27.573070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:27.573070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.3532","source_version":3,"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:29:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p6AzBp6rPCaV2Ak1udPGVILWXaw+7l0jjQKj9BBHdWF2ujiPrQ/5b5i+jb/22VCpj8UjBd0vd3SVZP/qDG4SBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:45:43.289165Z"},"content_sha256":"369284088760a3e51a46c23e564ee33e849344c336e24496dafb5ffcb88ddedb","schema_version":"1.0","event_id":"sha256:369284088760a3e51a46c23e564ee33e849344c336e24496dafb5ffcb88ddedb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TZS3DBTWUYXOUM4NBZHCRDGMUC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Algorithms on Rooted Triplet Consistency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Hadi Poormohammadi, Seyed Naser Hashemi, Soheil Jahangiri Tazehkand","submitted_at":"2012-05-16T00:25:31Z","abstract_excerpt":"An evolutionary tree (phylogenetic tree) is a binary, rooted, unordered tree that models the evolutionary history of currently living species in which leaves are labeled by species. In this paper, we investigate the problem of finding the maximum consensus evolutionary tree from a set of given rooted triplets. A rooted triplet is a phylogenetic tree on three leaves and shows the evolutionary relationship of the corresponding three species. The mentioned problem is known to be APX-hard. We present two new heuristic algorithms. For a given set of m triplets on n species, the FastTree algorithm r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3532","kind":"arxiv","version":3},"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:29:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+yym4Vzyj9JsbUvdLC6SyCT5GNT8w1OtHB9y0mDxlg56lwmI1NJwI+woFpkPJe0iU79tQI9bk188yiMilwyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:45:43.289858Z"},"content_sha256":"57473cf3c6854327395fc4e24acf15cdceaa41dc341fafcb427f22592fe1b5d0","schema_version":"1.0","event_id":"sha256:57473cf3c6854327395fc4e24acf15cdceaa41dc341fafcb427f22592fe1b5d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZS3DBTWUYXOUM4NBZHCRDGMUC/bundle.json","state_url":"https://pith.science/pith/TZS3DBTWUYXOUM4NBZHCRDGMUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZS3DBTWUYXOUM4NBZHCRDGMUC/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-31T08:45:43Z","links":{"resolver":"https://pith.science/pith/TZS3DBTWUYXOUM4NBZHCRDGMUC","bundle":"https://pith.science/pith/TZS3DBTWUYXOUM4NBZHCRDGMUC/bundle.json","state":"https://pith.science/pith/TZS3DBTWUYXOUM4NBZHCRDGMUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZS3DBTWUYXOUM4NBZHCRDGMUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TZS3DBTWUYXOUM4NBZHCRDGMUC","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":"d9d8c2cae5a923e7111bb922d182c776554349cf295975bc8f08971103fc520f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2012-05-16T00:25:31Z","title_canon_sha256":"4c899130fc7ccf95f16ed7b17d97ccfb6bffe4fef4f1cb65a85d2fad24686b88"},"schema_version":"1.0","source":{"id":"1205.3532","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3532","created_at":"2026-05-18T03:29:27Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3532v3","created_at":"2026-05-18T03:29:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3532","created_at":"2026-05-18T03:29:27Z"},{"alias_kind":"pith_short_12","alias_value":"TZS3DBTWUYXO","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TZS3DBTWUYXOUM4N","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TZS3DBTW","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:57473cf3c6854327395fc4e24acf15cdceaa41dc341fafcb427f22592fe1b5d0","target":"graph","created_at":"2026-05-18T03:29:27Z","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":"An evolutionary tree (phylogenetic tree) is a binary, rooted, unordered tree that models the evolutionary history of currently living species in which leaves are labeled by species. In this paper, we investigate the problem of finding the maximum consensus evolutionary tree from a set of given rooted triplets. A rooted triplet is a phylogenetic tree on three leaves and shows the evolutionary relationship of the corresponding three species. The mentioned problem is known to be APX-hard. We present two new heuristic algorithms. For a given set of m triplets on n species, the FastTree algorithm r","authors_text":"Hadi Poormohammadi, Seyed Naser Hashemi, Soheil Jahangiri Tazehkand","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2012-05-16T00:25:31Z","title":"New Algorithms on Rooted Triplet Consistency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3532","kind":"arxiv","version":3},"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:369284088760a3e51a46c23e564ee33e849344c336e24496dafb5ffcb88ddedb","target":"record","created_at":"2026-05-18T03:29:27Z","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":"d9d8c2cae5a923e7111bb922d182c776554349cf295975bc8f08971103fc520f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2012-05-16T00:25:31Z","title_canon_sha256":"4c899130fc7ccf95f16ed7b17d97ccfb6bffe4fef4f1cb65a85d2fad24686b88"},"schema_version":"1.0","source":{"id":"1205.3532","kind":"arxiv","version":3}},"canonical_sha256":"9e65b18676a62eea338d0e4e288ccca09d88f19fdfcb7b04284d8864692eea07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e65b18676a62eea338d0e4e288ccca09d88f19fdfcb7b04284d8864692eea07","first_computed_at":"2026-05-18T03:29:27.573070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:27.573070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GK5w2+XMbIa7G4ovBGayn/c6Syj0GAD5Ui5SqvVXwellWnIzR7e+Z0Q05z7hW2Lc8fRGOIWoIZUBqkG2tEbUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:27.573906Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3532","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:369284088760a3e51a46c23e564ee33e849344c336e24496dafb5ffcb88ddedb","sha256:57473cf3c6854327395fc4e24acf15cdceaa41dc341fafcb427f22592fe1b5d0"],"state_sha256":"56ec7539a6648ee46272d9888325a48c1afddfa912b5bca3eec354f857147a33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CSEoj7G9CSEwyOAP1NTGHA7BMo/g3ptgRbFI+QOXv7u3TBN85K3hnsChquHrwV4mN1HLM323hXaaCsRn+FI1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:45:43.293288Z","bundle_sha256":"63cf4958e2bf20fed78fde68d091f914dd2e72409d8748f3300dc6907ba9f629"}}