{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LKISNJQPDRUXESVP44P5QFN57U","short_pith_number":"pith:LKISNJQP","canonical_record":{"source":{"id":"1707.09579","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-07-30T03:34:56Z","cross_cats_sorted":[],"title_canon_sha256":"03c86096cd79aa430af0a48702a176529d971eec548b848cf4e290515eb0be0a","abstract_canon_sha256":"b4e1b554acc532f6aa252de51435ba78ac55ac9b1cc14e221c72f9c1fd03dd99"},"schema_version":"1.0"},"canonical_sha256":"5a9126a60f1c69724aafe71fd815bdfd32957fd37e5937e8753e3c25f4fd92e8","source":{"kind":"arxiv","id":"1707.09579","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09579","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09579v2","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09579","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"LKISNJQPDRUX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LKISNJQPDRUXESVP","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LKISNJQP","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LKISNJQPDRUXESVP44P5QFN57U","target":"record","payload":{"canonical_record":{"source":{"id":"1707.09579","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-07-30T03:34:56Z","cross_cats_sorted":[],"title_canon_sha256":"03c86096cd79aa430af0a48702a176529d971eec548b848cf4e290515eb0be0a","abstract_canon_sha256":"b4e1b554acc532f6aa252de51435ba78ac55ac9b1cc14e221c72f9c1fd03dd99"},"schema_version":"1.0"},"canonical_sha256":"5a9126a60f1c69724aafe71fd815bdfd32957fd37e5937e8753e3c25f4fd92e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:19.579745Z","signature_b64":"XQYhkwzYquENU7pHPSiY1VFheQtMgMFya/nkmS84N4RnYB//UHg4Y0e5QI5ZNfpQLzjkpm9TbnPG1tLqZ2ZGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a9126a60f1c69724aafe71fd815bdfd32957fd37e5937e8753e3c25f4fd92e8","last_reissued_at":"2026-05-18T00:03:19.579141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:19.579141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.09579","source_version":2,"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:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDP96FOA2SDpnzEbUZ2NvwDxKp6PEsHHTW4GIXLqbAqytJ8Pcgmr4hIgQQy4m7bM0WILCAMHGA33kZf5VpCwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:53:17.331757Z"},"content_sha256":"e5994f3338a1c09852c2af0f3b53d17644955cf667ef447f385bb1865cb0c1ae","schema_version":"1.0","event_id":"sha256:e5994f3338a1c09852c2af0f3b53d17644955cf667ef447f385bb1865cb0c1ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LKISNJQPDRUXESVP44P5QFN57U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The SNPR neighbourhood of tree-child networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan Klawitter","submitted_at":"2017-07-30T03:34:56Z","abstract_excerpt":"Network rearrangement operations like SNPR (SubNet Prune and Regraft), a recent generalisation of rSPR (rooted Subtree Prune and Regraft), induce a metric on phylogenetic networks. To search the space of these networks one important property of these metrics is the sizes of the neighbourhoods, that is, the number of networks reachable by exactly one operation from a given network. In this paper, we present exact expressions for the SNPR neighbourhood of tree-child networks, which depend on both the size and the topology of a network. We furthermore give upper and lower bounds for the minimum a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09579","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"},"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:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SnitkVT77Q/ypE3KRbO7Ww7MU2e4NHrvmhhC0+ZaN9ZtRfcqmmc1DX4DG5jTDOtDML76zXn3XqSKiLYwn6S6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:53:17.332431Z"},"content_sha256":"5acd4ff641ccc8e947f49153507fc6c5d4fa1846f8dea284fec1777bec32b827","schema_version":"1.0","event_id":"sha256:5acd4ff641ccc8e947f49153507fc6c5d4fa1846f8dea284fec1777bec32b827"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKISNJQPDRUXESVP44P5QFN57U/bundle.json","state_url":"https://pith.science/pith/LKISNJQPDRUXESVP44P5QFN57U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKISNJQPDRUXESVP44P5QFN57U/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-07T05:53:17Z","links":{"resolver":"https://pith.science/pith/LKISNJQPDRUXESVP44P5QFN57U","bundle":"https://pith.science/pith/LKISNJQPDRUXESVP44P5QFN57U/bundle.json","state":"https://pith.science/pith/LKISNJQPDRUXESVP44P5QFN57U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKISNJQPDRUXESVP44P5QFN57U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LKISNJQPDRUXESVP44P5QFN57U","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":"b4e1b554acc532f6aa252de51435ba78ac55ac9b1cc14e221c72f9c1fd03dd99","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-07-30T03:34:56Z","title_canon_sha256":"03c86096cd79aa430af0a48702a176529d971eec548b848cf4e290515eb0be0a"},"schema_version":"1.0","source":{"id":"1707.09579","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09579","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09579v2","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09579","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"LKISNJQPDRUX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LKISNJQPDRUXESVP","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LKISNJQP","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:5acd4ff641ccc8e947f49153507fc6c5d4fa1846f8dea284fec1777bec32b827","target":"graph","created_at":"2026-05-18T00:03:19Z","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":"Network rearrangement operations like SNPR (SubNet Prune and Regraft), a recent generalisation of rSPR (rooted Subtree Prune and Regraft), induce a metric on phylogenetic networks. To search the space of these networks one important property of these metrics is the sizes of the neighbourhoods, that is, the number of networks reachable by exactly one operation from a given network. In this paper, we present exact expressions for the SNPR neighbourhood of tree-child networks, which depend on both the size and the topology of a network. We furthermore give upper and lower bounds for the minimum a","authors_text":"Jonathan Klawitter","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-07-30T03:34:56Z","title":"The SNPR neighbourhood of tree-child networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09579","kind":"arxiv","version":2},"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:e5994f3338a1c09852c2af0f3b53d17644955cf667ef447f385bb1865cb0c1ae","target":"record","created_at":"2026-05-18T00:03:19Z","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":"b4e1b554acc532f6aa252de51435ba78ac55ac9b1cc14e221c72f9c1fd03dd99","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-07-30T03:34:56Z","title_canon_sha256":"03c86096cd79aa430af0a48702a176529d971eec548b848cf4e290515eb0be0a"},"schema_version":"1.0","source":{"id":"1707.09579","kind":"arxiv","version":2}},"canonical_sha256":"5a9126a60f1c69724aafe71fd815bdfd32957fd37e5937e8753e3c25f4fd92e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a9126a60f1c69724aafe71fd815bdfd32957fd37e5937e8753e3c25f4fd92e8","first_computed_at":"2026-05-18T00:03:19.579141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:19.579141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XQYhkwzYquENU7pHPSiY1VFheQtMgMFya/nkmS84N4RnYB//UHg4Y0e5QI5ZNfpQLzjkpm9TbnPG1tLqZ2ZGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:19.579745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.09579","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5994f3338a1c09852c2af0f3b53d17644955cf667ef447f385bb1865cb0c1ae","sha256:5acd4ff641ccc8e947f49153507fc6c5d4fa1846f8dea284fec1777bec32b827"],"state_sha256":"d9d2ac93540a62c1f20add61f7e2ed92a312bcf93f85c4d8014da918ccce015a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YhaaM/BkXqTIE77273tC/rkEI+515qmrOAmSo9vS/PN67zhyozRhbdZW/UwIY3ZIDyUf4vbaIgkuaEOuHZZ/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:53:17.336541Z","bundle_sha256":"8c72b83a272a089663ceb71953d4a3b5fefc80602e43a389304253d0ee82a2a5"}}