{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IMWIQ5VCQNLHN7TU6PLDWWPYMC","short_pith_number":"pith:IMWIQ5VC","schema_version":"1.0","canonical_sha256":"432c8876a2835676fe74f3d63b59f860a8e59938b14aeae3c6d04ec640c6b75b","source":{"kind":"arxiv","id":"1310.5202","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.5202","created_at":"2026-05-18T01:29:47.166733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5202v2","created_at":"2026-05-18T01:29:47.166733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5202","created_at":"2026-05-18T01:29:47.166733+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMWIQ5VCQNLH","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMWIQ5VCQNLHN7TU","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMWIQ5VC","created_at":"2026-05-18T12:27:46.883200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC","json":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC.json","graph_json":"https://pith.science/api/pith-number/IMWIQ5VCQNLHN7TU6PLDWWPYMC/graph.json","events_json":"https://pith.science/api/pith-number/IMWIQ5VCQNLHN7TU6PLDWWPYMC/events.json","paper":"https://pith.science/paper/IMWIQ5VC"},"agent_actions":{"view_html":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC","download_json":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC.json","view_paper":"https://pith.science/paper/IMWIQ5VC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5202&json=true","fetch_graph":"https://pith.science/api/pith-number/IMWIQ5VCQNLHN7TU6PLDWWPYMC/graph.json","fetch_events":"https://pith.science/api/pith-number/IMWIQ5VCQNLHN7TU6PLDWWPYMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC/action/storage_attestation","attest_author":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC/action/author_attestation","sign_citation":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC/action/citation_signature","submit_replication":"https://pith.science/pith/IMWIQ5VCQNLHN7TU6PLDWWPYMC/action/replication_record"}},"created_at":"2026-05-18T01:29:47.166733+00:00","updated_at":"2026-05-18T01:29:47.166733+00:00"}