{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HQADNQKVFLQ73TBOUYIV3EVYHI","short_pith_number":"pith:HQADNQKV","canonical_record":{"source":{"id":"1306.1339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-06-06T08:43:37Z","cross_cats_sorted":[],"title_canon_sha256":"c245d84678bbbaf4ab9d8dde473277281460de9daad57835db3cd2ce9075e8ba","abstract_canon_sha256":"300fb4a7f1e94cc92b24a23b33ddf893d5450735ecbc754961b662497bf1d258"},"schema_version":"1.0"},"canonical_sha256":"3c0036c1552ae1fdcc2ea6115d92b83a03a074f6bc9c7bf24fd8f64d517389e2","source":{"kind":"arxiv","id":"1306.1339","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1339","created_at":"2026-05-18T03:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1339v1","created_at":"2026-05-18T03:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1339","created_at":"2026-05-18T03:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"HQADNQKVFLQ7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HQADNQKVFLQ73TBO","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HQADNQKV","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HQADNQKVFLQ73TBOUYIV3EVYHI","target":"record","payload":{"canonical_record":{"source":{"id":"1306.1339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-06-06T08:43:37Z","cross_cats_sorted":[],"title_canon_sha256":"c245d84678bbbaf4ab9d8dde473277281460de9daad57835db3cd2ce9075e8ba","abstract_canon_sha256":"300fb4a7f1e94cc92b24a23b33ddf893d5450735ecbc754961b662497bf1d258"},"schema_version":"1.0"},"canonical_sha256":"3c0036c1552ae1fdcc2ea6115d92b83a03a074f6bc9c7bf24fd8f64d517389e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:34.557976Z","signature_b64":"7QE/YRpZvJBxN8pW0DAEYuBNcf9M85yuxRaoPBXMFAfMD/eFda2R5PnylWvtOMtH4sYXBc98dQ03aQsG18sPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c0036c1552ae1fdcc2ea6115d92b83a03a074f6bc9c7bf24fd8f64d517389e2","last_reissued_at":"2026-05-18T03:21:34.557433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:34.557433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.1339","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-18T03:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CSXRCjQDppEN+gC73z+HQEzD4vp+fSNpKL1yGzPbMM55O9DkKgK0TykW0O4LRYF3/bs3gmKpErq0kL3Sc8ARBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:22:02.938279Z"},"content_sha256":"3f8e2a10b21310a5abecc4ceb175adf6755f8a86a860eef6b4d4132e669507c9","schema_version":"1.0","event_id":"sha256:3f8e2a10b21310a5abecc4ceb175adf6755f8a86a860eef6b4d4132e669507c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HQADNQKVFLQ73TBOUYIV3EVYHI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hide and seek: placing and finding an optimal tree for thousands of homoplasy-rich sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Andreas Sand, Dietrich Radel, Mike Steel","submitted_at":"2013-06-06T08:43:37Z","abstract_excerpt":"Finding optimal evolutionary trees from sequence data is typically an intractable problem, and there is usually no way of knowing how close to optimal the best tree from some search truly is. The problem would seem to be particularly acute when we have many taxa and when that data has high levels of homoplasy, in which the individual characters require many changes to fit on the best tree. However, a recent mathematical result has provided a precise tool to generate a short number of high-homoplasy characters for any given tree, so that this tree is provably the optimal tree under the maximum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1339","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-18T03:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bb8weC7mupdD8RWhJz5tSjT9XkIg5pbdsu5E9daoZnfy2SnJARagzYuG9kw3zVbsdaNof36SKgCLhJIHz+mCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:22:02.938642Z"},"content_sha256":"01731ff25718826046d814121c07100c57e8330aa92d3e9f8ebbd1f37754bb78","schema_version":"1.0","event_id":"sha256:01731ff25718826046d814121c07100c57e8330aa92d3e9f8ebbd1f37754bb78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQADNQKVFLQ73TBOUYIV3EVYHI/bundle.json","state_url":"https://pith.science/pith/HQADNQKVFLQ73TBOUYIV3EVYHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQADNQKVFLQ73TBOUYIV3EVYHI/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-06-02T06:22:02Z","links":{"resolver":"https://pith.science/pith/HQADNQKVFLQ73TBOUYIV3EVYHI","bundle":"https://pith.science/pith/HQADNQKVFLQ73TBOUYIV3EVYHI/bundle.json","state":"https://pith.science/pith/HQADNQKVFLQ73TBOUYIV3EVYHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQADNQKVFLQ73TBOUYIV3EVYHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HQADNQKVFLQ73TBOUYIV3EVYHI","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":"300fb4a7f1e94cc92b24a23b33ddf893d5450735ecbc754961b662497bf1d258","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-06-06T08:43:37Z","title_canon_sha256":"c245d84678bbbaf4ab9d8dde473277281460de9daad57835db3cd2ce9075e8ba"},"schema_version":"1.0","source":{"id":"1306.1339","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1339","created_at":"2026-05-18T03:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1339v1","created_at":"2026-05-18T03:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1339","created_at":"2026-05-18T03:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"HQADNQKVFLQ7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HQADNQKVFLQ73TBO","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HQADNQKV","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:01731ff25718826046d814121c07100c57e8330aa92d3e9f8ebbd1f37754bb78","target":"graph","created_at":"2026-05-18T03:21:34Z","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":"Finding optimal evolutionary trees from sequence data is typically an intractable problem, and there is usually no way of knowing how close to optimal the best tree from some search truly is. The problem would seem to be particularly acute when we have many taxa and when that data has high levels of homoplasy, in which the individual characters require many changes to fit on the best tree. However, a recent mathematical result has provided a precise tool to generate a short number of high-homoplasy characters for any given tree, so that this tree is provably the optimal tree under the maximum ","authors_text":"Andreas Sand, Dietrich Radel, Mike Steel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-06-06T08:43:37Z","title":"Hide and seek: placing and finding an optimal tree for thousands of homoplasy-rich sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1339","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:3f8e2a10b21310a5abecc4ceb175adf6755f8a86a860eef6b4d4132e669507c9","target":"record","created_at":"2026-05-18T03:21:34Z","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":"300fb4a7f1e94cc92b24a23b33ddf893d5450735ecbc754961b662497bf1d258","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-06-06T08:43:37Z","title_canon_sha256":"c245d84678bbbaf4ab9d8dde473277281460de9daad57835db3cd2ce9075e8ba"},"schema_version":"1.0","source":{"id":"1306.1339","kind":"arxiv","version":1}},"canonical_sha256":"3c0036c1552ae1fdcc2ea6115d92b83a03a074f6bc9c7bf24fd8f64d517389e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c0036c1552ae1fdcc2ea6115d92b83a03a074f6bc9c7bf24fd8f64d517389e2","first_computed_at":"2026-05-18T03:21:34.557433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:34.557433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7QE/YRpZvJBxN8pW0DAEYuBNcf9M85yuxRaoPBXMFAfMD/eFda2R5PnylWvtOMtH4sYXBc98dQ03aQsG18sPBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:34.557976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1339","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f8e2a10b21310a5abecc4ceb175adf6755f8a86a860eef6b4d4132e669507c9","sha256:01731ff25718826046d814121c07100c57e8330aa92d3e9f8ebbd1f37754bb78"],"state_sha256":"ca22b909d0116ffefa0a3c4f72af0e3e106d655201d277eca73b3299a89dcf63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8oC+3eZuaUiumjI53dYt3bga6gJ32aw7vi1sW5m6Ey8q+pAa7GoYP3WD+DVMzs6jOgFUN8r35cL30tHkANF1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:22:02.940978Z","bundle_sha256":"74dd17020d3280058497d2fa549a4a18a83965f4422049d20d0292b959f0a1b6"}}