{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:V6Z6HTJBBMZA5CF6AN5OOEPCOI","short_pith_number":"pith:V6Z6HTJB","canonical_record":{"source":{"id":"1205.3402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-15T14:59:56Z","cross_cats_sorted":["cs.DC","q-bio.PE"],"title_canon_sha256":"1396c7aa5bda36f35c8e51b5c68485766b71ab98c65f5aa9fcd67cbb7487ec3c","abstract_canon_sha256":"bb9e920563160e9a6f46a50720931783738ce1983744188c8a34c060a7246dd7"},"schema_version":"1.0"},"canonical_sha256":"afb3e3cd210b320e88be037ae711e2722e1d599bd87ffc9a6a236d967e974c4a","source":{"kind":"arxiv","id":"1205.3402","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3402","created_at":"2026-05-18T03:55:36Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3402v1","created_at":"2026-05-18T03:55:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3402","created_at":"2026-05-18T03:55:36Z"},{"alias_kind":"pith_short_12","alias_value":"V6Z6HTJBBMZA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"V6Z6HTJBBMZA5CF6","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"V6Z6HTJB","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:V6Z6HTJBBMZA5CF6AN5OOEPCOI","target":"record","payload":{"canonical_record":{"source":{"id":"1205.3402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-15T14:59:56Z","cross_cats_sorted":["cs.DC","q-bio.PE"],"title_canon_sha256":"1396c7aa5bda36f35c8e51b5c68485766b71ab98c65f5aa9fcd67cbb7487ec3c","abstract_canon_sha256":"bb9e920563160e9a6f46a50720931783738ce1983744188c8a34c060a7246dd7"},"schema_version":"1.0"},"canonical_sha256":"afb3e3cd210b320e88be037ae711e2722e1d599bd87ffc9a6a236d967e974c4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:36.154415Z","signature_b64":"uIYyotka51D1weI2w7fOqGYcmVHn58IPsio+VeHEEHKFJ4lIFVoDHahZkGeJb0SazKXFF5Pz2LZqOQLd5zFLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afb3e3cd210b320e88be037ae711e2722e1d599bd87ffc9a6a236d967e974c4a","last_reissued_at":"2026-05-18T03:55:36.153870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:36.153870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.3402","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:55:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TatL299VCZ33SkFGYkxyVlhGbHG7GVEAPaifmV3C4WdW9Mk+7XuyWPwlo6Uo426td9kl/C065dvB6uEbzZv3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:40:26.925052Z"},"content_sha256":"628a8adb3f0483c0e5dc2bde028de399b68c9f5ef7dea647f87dfcc7dd34e7d5","schema_version":"1.0","event_id":"sha256:628a8adb3f0483c0e5dc2bde028de399b68c9f5ef7dea647f87dfcc7dd34e7d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:V6Z6HTJBBMZA5CF6AN5OOEPCOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Parallel Computation of Nearest Neighbor Interchange Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","q-bio.PE"],"primary_cat":"cs.DS","authors_text":"Mathias Hauptmann, Mikael Gast","submitted_at":"2012-05-15T14:59:56Z","abstract_excerpt":"The nni-distance is a well-known distance measure for phylogenetic trees. We construct an efficient parallel approximation algorithm for the nni-distance in the CRCW-PRAM model running in O(log n) time on O(n) processors. Given two phylogenetic trees T1 and T2 on the same set of taxa and with the same multi-set of edge-weights, the algorithm constructs a sequence of nni-operations of weight at most O(log n) \\cdot opt, where opt denotes the minimum weight of a sequence of nni-operations transforming T1 into T2 . This algorithm is based on the sequential approximation algorithm for the nni-dista"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3402","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:55:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jd7CKZSnbdkz3LPh/714yYR1lQYEeZCiPtdi1h+AsuCq+0CDOCPaP9QoqAAkP22PCqZZXCeZpzblmhX046wmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:40:26.925422Z"},"content_sha256":"d1996e9a41bc22a7754dc95ccce64b3d977a356d2d3277017797d959d757662b","schema_version":"1.0","event_id":"sha256:d1996e9a41bc22a7754dc95ccce64b3d977a356d2d3277017797d959d757662b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V6Z6HTJBBMZA5CF6AN5OOEPCOI/bundle.json","state_url":"https://pith.science/pith/V6Z6HTJBBMZA5CF6AN5OOEPCOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V6Z6HTJBBMZA5CF6AN5OOEPCOI/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-30T08:40:26Z","links":{"resolver":"https://pith.science/pith/V6Z6HTJBBMZA5CF6AN5OOEPCOI","bundle":"https://pith.science/pith/V6Z6HTJBBMZA5CF6AN5OOEPCOI/bundle.json","state":"https://pith.science/pith/V6Z6HTJBBMZA5CF6AN5OOEPCOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V6Z6HTJBBMZA5CF6AN5OOEPCOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:V6Z6HTJBBMZA5CF6AN5OOEPCOI","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":"bb9e920563160e9a6f46a50720931783738ce1983744188c8a34c060a7246dd7","cross_cats_sorted":["cs.DC","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-15T14:59:56Z","title_canon_sha256":"1396c7aa5bda36f35c8e51b5c68485766b71ab98c65f5aa9fcd67cbb7487ec3c"},"schema_version":"1.0","source":{"id":"1205.3402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3402","created_at":"2026-05-18T03:55:36Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3402v1","created_at":"2026-05-18T03:55:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3402","created_at":"2026-05-18T03:55:36Z"},{"alias_kind":"pith_short_12","alias_value":"V6Z6HTJBBMZA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"V6Z6HTJBBMZA5CF6","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"V6Z6HTJB","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:d1996e9a41bc22a7754dc95ccce64b3d977a356d2d3277017797d959d757662b","target":"graph","created_at":"2026-05-18T03:55:36Z","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 nni-distance is a well-known distance measure for phylogenetic trees. We construct an efficient parallel approximation algorithm for the nni-distance in the CRCW-PRAM model running in O(log n) time on O(n) processors. Given two phylogenetic trees T1 and T2 on the same set of taxa and with the same multi-set of edge-weights, the algorithm constructs a sequence of nni-operations of weight at most O(log n) \\cdot opt, where opt denotes the minimum weight of a sequence of nni-operations transforming T1 into T2 . This algorithm is based on the sequential approximation algorithm for the nni-dista","authors_text":"Mathias Hauptmann, Mikael Gast","cross_cats":["cs.DC","q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-15T14:59:56Z","title":"Efficient Parallel Computation of Nearest Neighbor Interchange Distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3402","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:628a8adb3f0483c0e5dc2bde028de399b68c9f5ef7dea647f87dfcc7dd34e7d5","target":"record","created_at":"2026-05-18T03:55:36Z","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":"bb9e920563160e9a6f46a50720931783738ce1983744188c8a34c060a7246dd7","cross_cats_sorted":["cs.DC","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-15T14:59:56Z","title_canon_sha256":"1396c7aa5bda36f35c8e51b5c68485766b71ab98c65f5aa9fcd67cbb7487ec3c"},"schema_version":"1.0","source":{"id":"1205.3402","kind":"arxiv","version":1}},"canonical_sha256":"afb3e3cd210b320e88be037ae711e2722e1d599bd87ffc9a6a236d967e974c4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afb3e3cd210b320e88be037ae711e2722e1d599bd87ffc9a6a236d967e974c4a","first_computed_at":"2026-05-18T03:55:36.153870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:36.153870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uIYyotka51D1weI2w7fOqGYcmVHn58IPsio+VeHEEHKFJ4lIFVoDHahZkGeJb0SazKXFF5Pz2LZqOQLd5zFLAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:36.154415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:628a8adb3f0483c0e5dc2bde028de399b68c9f5ef7dea647f87dfcc7dd34e7d5","sha256:d1996e9a41bc22a7754dc95ccce64b3d977a356d2d3277017797d959d757662b"],"state_sha256":"118759e0572b3acda0fb803d94f07e6b400207c0352f591e14bd5922a86cd9a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/txZwmExN4XE191DLQYI80/WIgwxWQwoiXAznozJwM+zvLuEEZDOjhFcNHHWJKb47PodpIDGA2UswNjUf8gCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:40:26.927623Z","bundle_sha256":"315d48b90ac6e026d7b0aa2892ba1c18e0586f92cf143113a43416e5a49f34c2"}}