{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZKCLTCSZN2FNGXBIW7SGN4UNSA","short_pith_number":"pith:ZKCLTCSZ","canonical_record":{"source":{"id":"1201.3722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-18T08:39:02Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"c400fac7a51570fbbd3f1dd390a0687da4ad0d98763929a46b6bd73dc4f96a1f","abstract_canon_sha256":"76cba90b40f79f00e9265662eec23376be3b18a6181a99c4fc591b4c3ea27d2b"},"schema_version":"1.0"},"canonical_sha256":"ca84b98a596e8ad35c28b7e466f28d9011406d58a2918fead2c793f11d050d3c","source":{"kind":"arxiv","id":"1201.3722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3722","created_at":"2026-05-18T04:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3722v1","created_at":"2026-05-18T04:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3722","created_at":"2026-05-18T04:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZKCLTCSZN2FN","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZKCLTCSZN2FNGXBI","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZKCLTCSZ","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZKCLTCSZN2FNGXBIW7SGN4UNSA","target":"record","payload":{"canonical_record":{"source":{"id":"1201.3722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-18T08:39:02Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"c400fac7a51570fbbd3f1dd390a0687da4ad0d98763929a46b6bd73dc4f96a1f","abstract_canon_sha256":"76cba90b40f79f00e9265662eec23376be3b18a6181a99c4fc591b4c3ea27d2b"},"schema_version":"1.0"},"canonical_sha256":"ca84b98a596e8ad35c28b7e466f28d9011406d58a2918fead2c793f11d050d3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:18.193225Z","signature_b64":"jkcN6OBZyouvs5fnZnrBEsUuGVT+UwfKHKV5n5gaffVljGJF9ASc7ClQjSMRxe8jrTBbhpGzlC2AtJ+8eChnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca84b98a596e8ad35c28b7e466f28d9011406d58a2918fead2c793f11d050d3c","last_reissued_at":"2026-05-18T04:04:18.192471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:18.192471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.3722","source_version":1,"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:04:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2UlF6LPr6JSJT2qZ+HdPDftcbdLaarUDJ/+7a+vmx9UClFJqnrGewb+Vh/xF9FxOCT/XmMtNgWLu5vkuawnaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:46:41.102418Z"},"content_sha256":"975b270e4fc1314ebaf69ae417962c1efe05d05ac06b75b5ce5f38ca34523384","schema_version":"1.0","event_id":"sha256:975b270e4fc1314ebaf69ae417962c1efe05d05ac06b75b5ce5f38ca34523384"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZKCLTCSZN2FNGXBIW7SGN4UNSA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TripNet: A Heuristic Algorithm for Constructing Rooted Phylogenetic Networks from Triplets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.DS","authors_text":"Changiz Eslahchi, Hadi Poormohammadi, Ruzbeh Tusserkani","submitted_at":"2012-01-18T08:39:02Z","abstract_excerpt":"The problem of constructing an optimal rooted phylogenetic network from a set of rooted triplets is an NP-hard problem. In this paper, we present a heuristic algorithm called TripNet which tries to construct an optimal rooted phylogenetic network from an arbitrary set of triplets. We prove some theorems to justify the performance of the algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3722","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"},"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:04:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJerOSzA3ofHeE0pO2mufhoziRirbf/DgzUB7Sn1ZQ6DicZbA25ElYoKr5YyO5MPn5oNR4fyO3LwCAHEfDaRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:46:41.103084Z"},"content_sha256":"5675797494b282de0caa37502fa79cb70e07e297c828a6c2af7452bd60596392","schema_version":"1.0","event_id":"sha256:5675797494b282de0caa37502fa79cb70e07e297c828a6c2af7452bd60596392"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKCLTCSZN2FNGXBIW7SGN4UNSA/bundle.json","state_url":"https://pith.science/pith/ZKCLTCSZN2FNGXBIW7SGN4UNSA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKCLTCSZN2FNGXBIW7SGN4UNSA/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-26T08:46:41Z","links":{"resolver":"https://pith.science/pith/ZKCLTCSZN2FNGXBIW7SGN4UNSA","bundle":"https://pith.science/pith/ZKCLTCSZN2FNGXBIW7SGN4UNSA/bundle.json","state":"https://pith.science/pith/ZKCLTCSZN2FNGXBIW7SGN4UNSA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKCLTCSZN2FNGXBIW7SGN4UNSA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZKCLTCSZN2FNGXBIW7SGN4UNSA","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":"76cba90b40f79f00e9265662eec23376be3b18a6181a99c4fc591b4c3ea27d2b","cross_cats_sorted":["q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-18T08:39:02Z","title_canon_sha256":"c400fac7a51570fbbd3f1dd390a0687da4ad0d98763929a46b6bd73dc4f96a1f"},"schema_version":"1.0","source":{"id":"1201.3722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3722","created_at":"2026-05-18T04:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3722v1","created_at":"2026-05-18T04:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3722","created_at":"2026-05-18T04:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZKCLTCSZN2FN","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZKCLTCSZN2FNGXBI","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZKCLTCSZ","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:5675797494b282de0caa37502fa79cb70e07e297c828a6c2af7452bd60596392","target":"graph","created_at":"2026-05-18T04:04:18Z","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":"The problem of constructing an optimal rooted phylogenetic network from a set of rooted triplets is an NP-hard problem. In this paper, we present a heuristic algorithm called TripNet which tries to construct an optimal rooted phylogenetic network from an arbitrary set of triplets. We prove some theorems to justify the performance of the algorithm.","authors_text":"Changiz Eslahchi, Hadi Poormohammadi, Ruzbeh Tusserkani","cross_cats":["q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-18T08:39:02Z","title":"TripNet: A Heuristic Algorithm for Constructing Rooted Phylogenetic Networks from Triplets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3722","kind":"arxiv","version":1},"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:975b270e4fc1314ebaf69ae417962c1efe05d05ac06b75b5ce5f38ca34523384","target":"record","created_at":"2026-05-18T04:04:18Z","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":"76cba90b40f79f00e9265662eec23376be3b18a6181a99c4fc591b4c3ea27d2b","cross_cats_sorted":["q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-18T08:39:02Z","title_canon_sha256":"c400fac7a51570fbbd3f1dd390a0687da4ad0d98763929a46b6bd73dc4f96a1f"},"schema_version":"1.0","source":{"id":"1201.3722","kind":"arxiv","version":1}},"canonical_sha256":"ca84b98a596e8ad35c28b7e466f28d9011406d58a2918fead2c793f11d050d3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca84b98a596e8ad35c28b7e466f28d9011406d58a2918fead2c793f11d050d3c","first_computed_at":"2026-05-18T04:04:18.192471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:18.192471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jkcN6OBZyouvs5fnZnrBEsUuGVT+UwfKHKV5n5gaffVljGJF9ASc7ClQjSMRxe8jrTBbhpGzlC2AtJ+8eChnAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:18.193225Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.3722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:975b270e4fc1314ebaf69ae417962c1efe05d05ac06b75b5ce5f38ca34523384","sha256:5675797494b282de0caa37502fa79cb70e07e297c828a6c2af7452bd60596392"],"state_sha256":"54d1aaa3d14a5a4db395da9c5c7a6681b78164da9b8c86b7e724a0764493143a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wrsH3KMP5BSA0JkqIbzXg1kSEvFznncdDRUQycaTKla3KjRzlBU3V3FhBGsX3T8nQ1cVCNsF67hmMRYVpkuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:46:41.107035Z","bundle_sha256":"3571b33704d85c976f73f169127ada2e0e1ce76b6423ebb38b8653d003f03535"}}