{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SOLELVSWKRJ3VY34K44WONII7J","short_pith_number":"pith:SOLELVSW","canonical_record":{"source":{"id":"1701.06249","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-01-23T01:44:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ef60f308e5b38f32837cec5e984198c415c3bd41e31516f7e61b5514556017dc","abstract_canon_sha256":"d14ab97df948bcc74ec41a3cff78ec352f39dda66f1282f6395b9830fe91866f"},"schema_version":"1.0"},"canonical_sha256":"939645d6565453bae37c5739673508fa5996534c2a38d61998a31f462a65b1a3","source":{"kind":"arxiv","id":"1701.06249","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06249","created_at":"2026-05-17T23:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06249v4","created_at":"2026-05-17T23:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06249","created_at":"2026-05-17T23:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"SOLELVSWKRJ3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SOLELVSWKRJ3VY34","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SOLELVSW","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SOLELVSWKRJ3VY34K44WONII7J","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06249","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-01-23T01:44:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ef60f308e5b38f32837cec5e984198c415c3bd41e31516f7e61b5514556017dc","abstract_canon_sha256":"d14ab97df948bcc74ec41a3cff78ec352f39dda66f1282f6395b9830fe91866f"},"schema_version":"1.0"},"canonical_sha256":"939645d6565453bae37c5739673508fa5996534c2a38d61998a31f462a65b1a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:10.485656Z","signature_b64":"Oznie+8FMc7tIE4/E2QdRUnh7GX5wdUrvZuv5Sm6ouMKB+nrG/nRArIXiPYfyK31aD+M3MU5HUH17BIG20D5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"939645d6565453bae37c5739673508fa5996534c2a38d61998a31f462a65b1a3","last_reissued_at":"2026-05-17T23:44:10.485050Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:10.485050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06249","source_version":4,"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-17T23:44:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMLUkzs3zyas/vsoBxTH+G6//wJDeMKku+kSkrjncdo9lCdcfN03F6egdjYWu46avvvC3X8hKu7GGXdfZtHaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:17:43.620969Z"},"content_sha256":"fee78632548868666f62dbf9affda6ea3e1ff4bf6ba3d535c7ba452fd3402f5a","schema_version":"1.0","event_id":"sha256:fee78632548868666f62dbf9affda6ea3e1ff4bf6ba3d535c7ba452fd3402f5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SOLELVSWKRJ3VY34K44WONII7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Behind Every Great Tree is a Great (Phylogenetic) Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"q-bio.PE","authors_text":"Michael Hendriksen","submitted_at":"2017-01-23T01:44:26Z","abstract_excerpt":"In Francis and Steel (2015), it was shown that there exists non-trivial networks on $4$ leaves upon which the distance metric affords a metric on a tree which is not the base tree of the network. In this paper we extend this result in two directions. We show that for any tree $T$ there exists a family of non-trivial HGT networks $N$ for which the distance metric $d_N$ affords a metric on $T$. We additionally provide a class of networks on any number of leaves upon which the distance metric affords a metric on a tree which is not the base tree of the network.\n  The family of networks are all \"f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06249","kind":"arxiv","version":4},"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-17T23:44:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBdlYLx2HWDE75KYF4A1O8/gM3ZfkMt2np9+gdaCfTayDrLEHY68wZXtTQoXABMUiU9A8MIWSjjt/a0Fk8x8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:17:43.621329Z"},"content_sha256":"59b88fe51cabd24e046075ff915faaf9205f729272dc43f02145b40f339c3964","schema_version":"1.0","event_id":"sha256:59b88fe51cabd24e046075ff915faaf9205f729272dc43f02145b40f339c3964"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOLELVSWKRJ3VY34K44WONII7J/bundle.json","state_url":"https://pith.science/pith/SOLELVSWKRJ3VY34K44WONII7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOLELVSWKRJ3VY34K44WONII7J/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-22T09:17:43Z","links":{"resolver":"https://pith.science/pith/SOLELVSWKRJ3VY34K44WONII7J","bundle":"https://pith.science/pith/SOLELVSWKRJ3VY34K44WONII7J/bundle.json","state":"https://pith.science/pith/SOLELVSWKRJ3VY34K44WONII7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOLELVSWKRJ3VY34K44WONII7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SOLELVSWKRJ3VY34K44WONII7J","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":"d14ab97df948bcc74ec41a3cff78ec352f39dda66f1282f6395b9830fe91866f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-01-23T01:44:26Z","title_canon_sha256":"ef60f308e5b38f32837cec5e984198c415c3bd41e31516f7e61b5514556017dc"},"schema_version":"1.0","source":{"id":"1701.06249","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06249","created_at":"2026-05-17T23:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06249v4","created_at":"2026-05-17T23:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06249","created_at":"2026-05-17T23:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"SOLELVSWKRJ3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SOLELVSWKRJ3VY34","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SOLELVSW","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:59b88fe51cabd24e046075ff915faaf9205f729272dc43f02145b40f339c3964","target":"graph","created_at":"2026-05-17T23:44:10Z","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 Francis and Steel (2015), it was shown that there exists non-trivial networks on $4$ leaves upon which the distance metric affords a metric on a tree which is not the base tree of the network. In this paper we extend this result in two directions. We show that for any tree $T$ there exists a family of non-trivial HGT networks $N$ for which the distance metric $d_N$ affords a metric on $T$. We additionally provide a class of networks on any number of leaves upon which the distance metric affords a metric on a tree which is not the base tree of the network.\n  The family of networks are all \"f","authors_text":"Michael Hendriksen","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-01-23T01:44:26Z","title":"Behind Every Great Tree is a Great (Phylogenetic) Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06249","kind":"arxiv","version":4},"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:fee78632548868666f62dbf9affda6ea3e1ff4bf6ba3d535c7ba452fd3402f5a","target":"record","created_at":"2026-05-17T23:44:10Z","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":"d14ab97df948bcc74ec41a3cff78ec352f39dda66f1282f6395b9830fe91866f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-01-23T01:44:26Z","title_canon_sha256":"ef60f308e5b38f32837cec5e984198c415c3bd41e31516f7e61b5514556017dc"},"schema_version":"1.0","source":{"id":"1701.06249","kind":"arxiv","version":4}},"canonical_sha256":"939645d6565453bae37c5739673508fa5996534c2a38d61998a31f462a65b1a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"939645d6565453bae37c5739673508fa5996534c2a38d61998a31f462a65b1a3","first_computed_at":"2026-05-17T23:44:10.485050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:10.485050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oznie+8FMc7tIE4/E2QdRUnh7GX5wdUrvZuv5Sm6ouMKB+nrG/nRArIXiPYfyK31aD+M3MU5HUH17BIG20D5CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:10.485656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06249","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fee78632548868666f62dbf9affda6ea3e1ff4bf6ba3d535c7ba452fd3402f5a","sha256:59b88fe51cabd24e046075ff915faaf9205f729272dc43f02145b40f339c3964"],"state_sha256":"200025d5551d65b4d60dab0b99097252aecded6079920f6c6b1e67ae40006f0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rS5kata33MvC71nT03x5c91+bGUL3W5p6a2XHnYlHbWdU0m5VwEoMJl1sRtaPBDZ61rmWk3TrcVysXpSDV0TCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:17:43.623269Z","bundle_sha256":"08e5383dc0d3de01613724e6ef7395f42a3ecf98475718e98f0ae1ee02ea4909"}}