{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AYOQN7SQS36CPUTLSPKBVQ4TCU","short_pith_number":"pith:AYOQN7SQ","canonical_record":{"source":{"id":"1703.05097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-03-15T11:57:53Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"2c42bb4b6141bedef2468d16cee999f1e2b6abf2d6a2f4955943a5e49a652fd1","abstract_canon_sha256":"884fb6a5b33f9c7e1c2bec39059b6821a2861fb660a52ddbd6b4864e92ee6c0c"},"schema_version":"1.0"},"canonical_sha256":"061d06fe5096fc27d26b93d41ac393150749993da87d5fcc8c9b23a86f7ef3f6","source":{"kind":"arxiv","id":"1703.05097","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05097","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05097v1","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05097","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"pith_short_12","alias_value":"AYOQN7SQS36C","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AYOQN7SQS36CPUTL","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AYOQN7SQ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AYOQN7SQS36CPUTLSPKBVQ4TCU","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-03-15T11:57:53Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"2c42bb4b6141bedef2468d16cee999f1e2b6abf2d6a2f4955943a5e49a652fd1","abstract_canon_sha256":"884fb6a5b33f9c7e1c2bec39059b6821a2861fb660a52ddbd6b4864e92ee6c0c"},"schema_version":"1.0"},"canonical_sha256":"061d06fe5096fc27d26b93d41ac393150749993da87d5fcc8c9b23a86f7ef3f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:38.400165Z","signature_b64":"q81qBo+xt5bZR7yS+fSpyApl1kxFXvk1Yo3yFc8mURynYDdLCqD2I+tuN0jqUfCfIHWql8Ku9bRyYEPoHNXxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"061d06fe5096fc27d26b93d41ac393150749993da87d5fcc8c9b23a86f7ef3f6","last_reissued_at":"2026-05-18T00:48:38.399535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:38.399535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05097","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-18T00:48:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGC6XprMD7Jbt9UI01w0z2gwhnE0iV/HqZCbRMP1leeQhj914lIRfD+BrT4/8QhlJKaZCVzeP0NzOX8MkDyyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:36:48.461015Z"},"content_sha256":"9e5e594b7b1e37d127894c34d93c8ef04a9a62dc8c93a99d51f257c78798d155","schema_version":"1.0","event_id":"sha256:9e5e594b7b1e37d127894c34d93c8ef04a9a62dc8c93a99d51f257c78798d155"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AYOQN7SQS36CPUTLSPKBVQ4TCU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A cubic-time algorithm for computing the trinet distance between level-1 networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"q-bio.PE","authors_text":"James Oldman, Taoyang Wu, Vincent Moulton","submitted_at":"2017-03-15T11:57:53Z","abstract_excerpt":"In evolutionary biology, phylogenetic networks are constructed to represent the evolution of species in which reticulate events are thought to have occurred, such as recombination and hybridization. It is therefore useful to have efficiently computable metrics with which to systematically compare such networks. Through developing an optimal algorithm to enumerate all trinets displayed by a level-1 network (a type of network that is slightly more general than an evolutionary tree), here we propose a cubic-time algorithm to compute the trinet distance between two level-1 networks. Employing simu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05097","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-18T00:48:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSTLPgwJUUgBx4/Zs5nJ8BLFWtLhxTulJ/iOsW3vOoTeoJU5EVxhBGNrpsgWBtXfkBHGLKUjsT6YSY6RpD2NDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:36:48.461651Z"},"content_sha256":"8f663096e5883b83888edac0ae571221bf7681e17bf698f2a2bf42d9ca5a361e","schema_version":"1.0","event_id":"sha256:8f663096e5883b83888edac0ae571221bf7681e17bf698f2a2bf42d9ca5a361e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AYOQN7SQS36CPUTLSPKBVQ4TCU/bundle.json","state_url":"https://pith.science/pith/AYOQN7SQS36CPUTLSPKBVQ4TCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AYOQN7SQS36CPUTLSPKBVQ4TCU/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-12T00:36:48Z","links":{"resolver":"https://pith.science/pith/AYOQN7SQS36CPUTLSPKBVQ4TCU","bundle":"https://pith.science/pith/AYOQN7SQS36CPUTLSPKBVQ4TCU/bundle.json","state":"https://pith.science/pith/AYOQN7SQS36CPUTLSPKBVQ4TCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AYOQN7SQS36CPUTLSPKBVQ4TCU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AYOQN7SQS36CPUTLSPKBVQ4TCU","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":"884fb6a5b33f9c7e1c2bec39059b6821a2861fb660a52ddbd6b4864e92ee6c0c","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-03-15T11:57:53Z","title_canon_sha256":"2c42bb4b6141bedef2468d16cee999f1e2b6abf2d6a2f4955943a5e49a652fd1"},"schema_version":"1.0","source":{"id":"1703.05097","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05097","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05097v1","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05097","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"pith_short_12","alias_value":"AYOQN7SQS36C","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AYOQN7SQS36CPUTL","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AYOQN7SQ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:8f663096e5883b83888edac0ae571221bf7681e17bf698f2a2bf42d9ca5a361e","target":"graph","created_at":"2026-05-18T00:48:38Z","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 evolutionary biology, phylogenetic networks are constructed to represent the evolution of species in which reticulate events are thought to have occurred, such as recombination and hybridization. It is therefore useful to have efficiently computable metrics with which to systematically compare such networks. Through developing an optimal algorithm to enumerate all trinets displayed by a level-1 network (a type of network that is slightly more general than an evolutionary tree), here we propose a cubic-time algorithm to compute the trinet distance between two level-1 networks. Employing simu","authors_text":"James Oldman, Taoyang Wu, Vincent Moulton","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-03-15T11:57:53Z","title":"A cubic-time algorithm for computing the trinet distance between level-1 networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05097","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:9e5e594b7b1e37d127894c34d93c8ef04a9a62dc8c93a99d51f257c78798d155","target":"record","created_at":"2026-05-18T00:48:38Z","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":"884fb6a5b33f9c7e1c2bec39059b6821a2861fb660a52ddbd6b4864e92ee6c0c","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-03-15T11:57:53Z","title_canon_sha256":"2c42bb4b6141bedef2468d16cee999f1e2b6abf2d6a2f4955943a5e49a652fd1"},"schema_version":"1.0","source":{"id":"1703.05097","kind":"arxiv","version":1}},"canonical_sha256":"061d06fe5096fc27d26b93d41ac393150749993da87d5fcc8c9b23a86f7ef3f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"061d06fe5096fc27d26b93d41ac393150749993da87d5fcc8c9b23a86f7ef3f6","first_computed_at":"2026-05-18T00:48:38.399535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:38.399535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q81qBo+xt5bZR7yS+fSpyApl1kxFXvk1Yo3yFc8mURynYDdLCqD2I+tuN0jqUfCfIHWql8Ku9bRyYEPoHNXxDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:38.400165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05097","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e5e594b7b1e37d127894c34d93c8ef04a9a62dc8c93a99d51f257c78798d155","sha256:8f663096e5883b83888edac0ae571221bf7681e17bf698f2a2bf42d9ca5a361e"],"state_sha256":"ef7e39aecaf03d371a6318fca3c3538b94d171a11b775ad4bffaf96c610dc748"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iNSGF/ZXL4zMUb+hOdniQpK1v51Bpq21NZNjiAQDYwkcvuubVouyT/05q1BQ8WmhUGCW13HQSE8FKzxwdbR7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:36:48.465402Z","bundle_sha256":"614aeda32a571a3d98e81de7968504bd1b4921475db34ba235a6c33b3fb73445"}}