{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JFSNTCAKYPWGZQDA56V54HJJCF","short_pith_number":"pith:JFSNTCAK","canonical_record":{"source":{"id":"1510.00115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-10-01T06:11:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cea96197f69af298ecd653d21aaeba46047e847d7152df0d924bf5f9a0b03189","abstract_canon_sha256":"99e009ebfa92d9ea8381937a6a6963144ba89d24ca24a8bba4481d4f99ee75e6"},"schema_version":"1.0"},"canonical_sha256":"4964d9880ac3ec6cc060efabde1d29114062abe65c6e8abe7dd1d7771a35a4d5","source":{"kind":"arxiv","id":"1510.00115","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00115","created_at":"2026-05-18T01:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00115v1","created_at":"2026-05-18T01:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00115","created_at":"2026-05-18T01:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"JFSNTCAKYPWG","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JFSNTCAKYPWGZQDA","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JFSNTCAK","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JFSNTCAKYPWGZQDA56V54HJJCF","target":"record","payload":{"canonical_record":{"source":{"id":"1510.00115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-10-01T06:11:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cea96197f69af298ecd653d21aaeba46047e847d7152df0d924bf5f9a0b03189","abstract_canon_sha256":"99e009ebfa92d9ea8381937a6a6963144ba89d24ca24a8bba4481d4f99ee75e6"},"schema_version":"1.0"},"canonical_sha256":"4964d9880ac3ec6cc060efabde1d29114062abe65c6e8abe7dd1d7771a35a4d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:20.717252Z","signature_b64":"VKKFd511n/pqEMA98D795dPmAokBQ9jVoHCO5DP8h/Fkkufy6L+EGAcnkhy9XbsyOC6kXzQsYUHzLFxAnfgwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4964d9880ac3ec6cc060efabde1d29114062abe65c6e8abe7dd1d7771a35a4d5","last_reissued_at":"2026-05-18T01:31:20.716623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:20.716623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.00115","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-18T01:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vRzkwAN74SDU2LVVS8qy2H5SJrBOFHF4rIZByt2j89R2rLNkA3gqacTHqgInDww/2XSk0IP9mt5dmWcfoMgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:02:37.509552Z"},"content_sha256":"c5831b643f25355b921b1cfe67ffc5e07e86dfcb11d64bb7be74a34e648a29e3","schema_version":"1.0","event_id":"sha256:c5831b643f25355b921b1cfe67ffc5e07e86dfcb11d64bb7be74a34e648a29e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JFSNTCAKYPWGZQDA56V54HJJCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding the Size of a Network Defined By Visibility Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"q-bio.PE","authors_text":"Andreas D. M. Gunawan, Louxin Zhang","submitted_at":"2015-10-01T06:11:15Z","abstract_excerpt":"Phylogenetic networks are mathematical structures for modeling and visualization of reticulation processes in the study of evolution. Galled networks, reticulation visible networks, nearly-stable networks and stable-child networks are the four classes of phylogenetic networks that are recently introduced to study the topological and algorithmic aspects of phylogenetic networks. We prove the following results.\n  (1) A binary galled network with n leaves has at most 2(n-1) reticulation nodes. (2) A binary nearly-stable network with n leaves has at most 3(n-1) reticulation nodes. (3) A binary sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00115","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-18T01:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXvs3XdMxTFod1pn8MwoDHXwNBYAH8mMmOga2FwWWNzA9/HD+N0OjK+OjzcHhkBABx1ZCz+HHcQ5mb5C8621BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:02:37.510241Z"},"content_sha256":"a8b1242de01d7132a9425b5e5772691a5fe31aeb1b8d1025fb8853ab2db634b4","schema_version":"1.0","event_id":"sha256:a8b1242de01d7132a9425b5e5772691a5fe31aeb1b8d1025fb8853ab2db634b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JFSNTCAKYPWGZQDA56V54HJJCF/bundle.json","state_url":"https://pith.science/pith/JFSNTCAKYPWGZQDA56V54HJJCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JFSNTCAKYPWGZQDA56V54HJJCF/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-08T21:02:37Z","links":{"resolver":"https://pith.science/pith/JFSNTCAKYPWGZQDA56V54HJJCF","bundle":"https://pith.science/pith/JFSNTCAKYPWGZQDA56V54HJJCF/bundle.json","state":"https://pith.science/pith/JFSNTCAKYPWGZQDA56V54HJJCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JFSNTCAKYPWGZQDA56V54HJJCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JFSNTCAKYPWGZQDA56V54HJJCF","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":"99e009ebfa92d9ea8381937a6a6963144ba89d24ca24a8bba4481d4f99ee75e6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-10-01T06:11:15Z","title_canon_sha256":"cea96197f69af298ecd653d21aaeba46047e847d7152df0d924bf5f9a0b03189"},"schema_version":"1.0","source":{"id":"1510.00115","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00115","created_at":"2026-05-18T01:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00115v1","created_at":"2026-05-18T01:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00115","created_at":"2026-05-18T01:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"JFSNTCAKYPWG","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JFSNTCAKYPWGZQDA","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JFSNTCAK","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:a8b1242de01d7132a9425b5e5772691a5fe31aeb1b8d1025fb8853ab2db634b4","target":"graph","created_at":"2026-05-18T01:31:20Z","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":"Phylogenetic networks are mathematical structures for modeling and visualization of reticulation processes in the study of evolution. Galled networks, reticulation visible networks, nearly-stable networks and stable-child networks are the four classes of phylogenetic networks that are recently introduced to study the topological and algorithmic aspects of phylogenetic networks. We prove the following results.\n  (1) A binary galled network with n leaves has at most 2(n-1) reticulation nodes. (2) A binary nearly-stable network with n leaves has at most 3(n-1) reticulation nodes. (3) A binary sta","authors_text":"Andreas D. M. Gunawan, Louxin Zhang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-10-01T06:11:15Z","title":"Bounding the Size of a Network Defined By Visibility Property"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00115","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:c5831b643f25355b921b1cfe67ffc5e07e86dfcb11d64bb7be74a34e648a29e3","target":"record","created_at":"2026-05-18T01:31:20Z","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":"99e009ebfa92d9ea8381937a6a6963144ba89d24ca24a8bba4481d4f99ee75e6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-10-01T06:11:15Z","title_canon_sha256":"cea96197f69af298ecd653d21aaeba46047e847d7152df0d924bf5f9a0b03189"},"schema_version":"1.0","source":{"id":"1510.00115","kind":"arxiv","version":1}},"canonical_sha256":"4964d9880ac3ec6cc060efabde1d29114062abe65c6e8abe7dd1d7771a35a4d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4964d9880ac3ec6cc060efabde1d29114062abe65c6e8abe7dd1d7771a35a4d5","first_computed_at":"2026-05-18T01:31:20.716623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:20.716623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VKKFd511n/pqEMA98D795dPmAokBQ9jVoHCO5DP8h/Fkkufy6L+EGAcnkhy9XbsyOC6kXzQsYUHzLFxAnfgwAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:20.717252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00115","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5831b643f25355b921b1cfe67ffc5e07e86dfcb11d64bb7be74a34e648a29e3","sha256:a8b1242de01d7132a9425b5e5772691a5fe31aeb1b8d1025fb8853ab2db634b4"],"state_sha256":"295d49fbbfb4d65089f2c3df5bb435b6c90d0fa72e54d19134246e6150795b76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i8BSx1Rid5kCu9+Noj4+RUKEFkqHpWSGwtI4eJRIDLGkveTppIocYpI1GOdDZoGRCuVxBTk2dFhJpghpcbsyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:02:37.514095Z","bundle_sha256":"4a33694af50d0b3773b3086c75b54032aba1f11aea6d136c1681f4abd4dafd6c"}}