{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IMWIQ5VCQNLHN7TU6PLDWWPYMC","short_pith_number":"pith:IMWIQ5VC","canonical_record":{"source":{"id":"1310.5202","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-10-19T05:03:23Z","cross_cats_sorted":["cs.CE","cs.CG"],"title_canon_sha256":"e10735e8607c554d21946c84c208d460a379c48f8b70ed7a59f3d1824138ecb0","abstract_canon_sha256":"1e29e5bbdd03c79390603b7384cbac04db16135e5b8a9ab47f5207771ea8213d"},"schema_version":"1.0"},"canonical_sha256":"432c8876a2835676fe74f3d63b59f860a8e59938b14aeae3c6d04ec640c6b75b","source":{"kind":"arxiv","id":"1310.5202","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5202","created_at":"2026-05-18T01:29:47Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5202v2","created_at":"2026-05-18T01:29:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5202","created_at":"2026-05-18T01:29:47Z"},{"alias_kind":"pith_short_12","alias_value":"IMWIQ5VCQNLH","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IMWIQ5VCQNLHN7TU","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IMWIQ5VC","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IMWIQ5VCQNLHN7TU6PLDWWPYMC","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5202","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-10-19T05:03:23Z","cross_cats_sorted":["cs.CE","cs.CG"],"title_canon_sha256":"e10735e8607c554d21946c84c208d460a379c48f8b70ed7a59f3d1824138ecb0","abstract_canon_sha256":"1e29e5bbdd03c79390603b7384cbac04db16135e5b8a9ab47f5207771ea8213d"},"schema_version":"1.0"},"canonical_sha256":"432c8876a2835676fe74f3d63b59f860a8e59938b14aeae3c6d04ec640c6b75b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:47.167180Z","signature_b64":"SDj5YCLqMtmRy4Q3cVH9Vg2UiuEudCB8Z7rab2qo/Cu07yUVO/S16SeZM/7wXjuME1elZ6uT0wNT7qnMehcKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"432c8876a2835676fe74f3d63b59f860a8e59938b14aeae3c6d04ec640c6b75b","last_reissued_at":"2026-05-18T01:29:47.166639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:47.166639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5202","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-18T01:29:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0JQM5RmCPLpom6RrIKiLHMfJ9HohxOM86XTzsqctKJzpovo8xukGIuUv4WS+nCLupn/BCaZrTD12FdO27pWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:02:19.147934Z"},"content_sha256":"efa160d4af1d038cc1ffe2e346ac80539726ce8ccb77fc2552cca95c5c4bfb92","schema_version":"1.0","event_id":"sha256:efa160d4af1d038cc1ffe2e346ac80539726ce8ccb77fc2552cca95c5c4bfb92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IMWIQ5VCQNLHN7TU6PLDWWPYMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discriminative Measures for Comparison of Phylogenetic Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.CG"],"primary_cat":"q-bio.PE","authors_text":"Daniel E. Koditschek, Dan P. Guralnik, Omur Arslan","submitted_at":"2013-10-19T05:03:23Z","abstract_excerpt":"In this paper we introduce and study three new measures for efficient discriminative comparison of phylogenetic trees. The NNI navigation dissimilarity $d_{nav}$ counts the steps along a \"combing\" of the Nearest Neighbor Interchange (NNI) graph of binary hierarchies, providing an efficient approximation to the (NP-hard) NNI distance in terms of \"edit length\". At the same time, a closed form formula for $d_{nav}$ presents it as a weighted count of pairwise incompatibilities between clusters, lending it the character of an edge dissimilarity measure as well. A relaxation of this formula to a sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5202","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-18T01:29:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vF71wvvk/7zjOoyXBkkAMk7daK8J3FoFP0PgcBMB37W8fgcGj+aQoeqySPk/DVpcEvm6wlproseKKO0EjfBsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:02:19.148663Z"},"content_sha256":"fb7d3d317c25cc97ded0b06b235ba6768c3687f39233d2f175e4ba1b7a0fa31b","schema_version":"1.0","event_id":"sha256:fb7d3d317c25cc97ded0b06b235ba6768c3687f39233d2f175e4ba1b7a0fa31b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC/bundle.json","state_url":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC/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-01T02:02:19Z","links":{"resolver":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC","bundle":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC/bundle.json","state":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IMWIQ5VCQNLHN7TU6PLDWWPYMC","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":"1e29e5bbdd03c79390603b7384cbac04db16135e5b8a9ab47f5207771ea8213d","cross_cats_sorted":["cs.CE","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-10-19T05:03:23Z","title_canon_sha256":"e10735e8607c554d21946c84c208d460a379c48f8b70ed7a59f3d1824138ecb0"},"schema_version":"1.0","source":{"id":"1310.5202","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5202","created_at":"2026-05-18T01:29:47Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5202v2","created_at":"2026-05-18T01:29:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5202","created_at":"2026-05-18T01:29:47Z"},{"alias_kind":"pith_short_12","alias_value":"IMWIQ5VCQNLH","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IMWIQ5VCQNLHN7TU","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IMWIQ5VC","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:fb7d3d317c25cc97ded0b06b235ba6768c3687f39233d2f175e4ba1b7a0fa31b","target":"graph","created_at":"2026-05-18T01:29:47Z","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":"In this paper we introduce and study three new measures for efficient discriminative comparison of phylogenetic trees. The NNI navigation dissimilarity $d_{nav}$ counts the steps along a \"combing\" of the Nearest Neighbor Interchange (NNI) graph of binary hierarchies, providing an efficient approximation to the (NP-hard) NNI distance in terms of \"edit length\". At the same time, a closed form formula for $d_{nav}$ presents it as a weighted count of pairwise incompatibilities between clusters, lending it the character of an edge dissimilarity measure as well. A relaxation of this formula to a sim","authors_text":"Daniel E. Koditschek, Dan P. Guralnik, Omur Arslan","cross_cats":["cs.CE","cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-10-19T05:03:23Z","title":"Discriminative Measures for Comparison of Phylogenetic Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5202","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:efa160d4af1d038cc1ffe2e346ac80539726ce8ccb77fc2552cca95c5c4bfb92","target":"record","created_at":"2026-05-18T01:29:47Z","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":"1e29e5bbdd03c79390603b7384cbac04db16135e5b8a9ab47f5207771ea8213d","cross_cats_sorted":["cs.CE","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-10-19T05:03:23Z","title_canon_sha256":"e10735e8607c554d21946c84c208d460a379c48f8b70ed7a59f3d1824138ecb0"},"schema_version":"1.0","source":{"id":"1310.5202","kind":"arxiv","version":2}},"canonical_sha256":"432c8876a2835676fe74f3d63b59f860a8e59938b14aeae3c6d04ec640c6b75b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"432c8876a2835676fe74f3d63b59f860a8e59938b14aeae3c6d04ec640c6b75b","first_computed_at":"2026-05-18T01:29:47.166639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:47.166639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SDj5YCLqMtmRy4Q3cVH9Vg2UiuEudCB8Z7rab2qo/Cu07yUVO/S16SeZM/7wXjuME1elZ6uT0wNT7qnMehcKBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:47.167180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5202","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efa160d4af1d038cc1ffe2e346ac80539726ce8ccb77fc2552cca95c5c4bfb92","sha256:fb7d3d317c25cc97ded0b06b235ba6768c3687f39233d2f175e4ba1b7a0fa31b"],"state_sha256":"37d6a53468f5595f21d5a5677035eb9b68f36f9e87789bfefedf8ea777301f3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Qt3alDXyzcMmqusfakIQKchCorSrIVM3gwpvb647g2vu66+1/vvfflu2zpc/mQHW88tb/oGwphgu9C8R9SpDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:02:19.152615Z","bundle_sha256":"e39b3d7751084c29e04a26f7271c6c192278eac5bfce8bc1dfe8a51c8d19136b"}}