{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SQMYL5ZGUHDT3ZKMWM3I33THGO","short_pith_number":"pith:SQMYL5ZG","canonical_record":{"source":{"id":"1508.03774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-08-15T22:24:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8c9a469a2a9ec81d951c4186bcde23bc5f68f257de456e5156ae28cd71a07dd1","abstract_canon_sha256":"1760a45424be1bb28a7b7f1759f2d776ead14059e037077def5e6fca82745ccf"},"schema_version":"1.0"},"canonical_sha256":"941985f726a1c73de54cb3368dee6733bd52424f47d99c50d5b8da041989d195","source":{"kind":"arxiv","id":"1508.03774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03774","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03774v1","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03774","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"SQMYL5ZGUHDT","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SQMYL5ZGUHDT3ZKM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SQMYL5ZG","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SQMYL5ZGUHDT3ZKMWM3I33THGO","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-08-15T22:24:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8c9a469a2a9ec81d951c4186bcde23bc5f68f257de456e5156ae28cd71a07dd1","abstract_canon_sha256":"1760a45424be1bb28a7b7f1759f2d776ead14059e037077def5e6fca82745ccf"},"schema_version":"1.0"},"canonical_sha256":"941985f726a1c73de54cb3368dee6733bd52424f47d99c50d5b8da041989d195","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:11.906522Z","signature_b64":"DfE9QK0zRsOxxvyisdiAP2KsDO2YmEoUKFazzZVAwGzZQpz5WEr91TK1qgMnhBL5MLtmU+xRht505pgqIuYWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"941985f726a1c73de54cb3368dee6733bd52424f47d99c50d5b8da041989d195","last_reissued_at":"2026-05-18T01:09:11.905904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:11.905904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03774","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:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHVbN9paoOYJWpAHf+N2HOibtnXit9rdjY3ZA4saIVL8qXVKFVGGQ/uQeoeCrNCQbkaYtCte+meLbR6/ae2KCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:33:33.766174Z"},"content_sha256":"88702d08d507dff36c6ac5c2cecf49c5bb77d3d7cd6213c7ba87deaf53710242","schema_version":"1.0","event_id":"sha256:88702d08d507dff36c6ac5c2cecf49c5bb77d3d7cd6213c7ba87deaf53710242"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SQMYL5ZGUHDT3ZKMWM3I33THGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neighbourhoods of phylogenetic trees: exact and asymptotic counts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"q-bio.PE","authors_text":"Jamie V. de Jong, Jeanette C McLeod, Mike Steel","submitted_at":"2015-08-15T22:24:33Z","abstract_excerpt":"A central theme in phylogenetics is the reconstruction and analysis of evolutionary trees from a given set of data. To determine the optimal search methods for reconstructing trees, it is crucial to understand the size and structure of the neighbourhoods of trees under tree rearrangement operations. The diameter and size of the immediate neighbourhood of a tree has been well-studied, however little is known about the number of trees at distance two, three or (more generally) $k$ from a given tree. In this paper we provide a number of exact and asymptotic results concerning these quantities, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03774","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:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uAzxuDZSZ+4ADUlHA8WvtgJBHSDwoCDy4jVEpzMEZ2Mc3CX5qua7u2oHXWFYQBmKAw00zekXrJBzgKImmULkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:33:33.766545Z"},"content_sha256":"910617ae7d8d82d10d6713505d7a380ee15226d1bc46c333f886b6dc59ef1d2c","schema_version":"1.0","event_id":"sha256:910617ae7d8d82d10d6713505d7a380ee15226d1bc46c333f886b6dc59ef1d2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQMYL5ZGUHDT3ZKMWM3I33THGO/bundle.json","state_url":"https://pith.science/pith/SQMYL5ZGUHDT3ZKMWM3I33THGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQMYL5ZGUHDT3ZKMWM3I33THGO/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-31T01:33:33Z","links":{"resolver":"https://pith.science/pith/SQMYL5ZGUHDT3ZKMWM3I33THGO","bundle":"https://pith.science/pith/SQMYL5ZGUHDT3ZKMWM3I33THGO/bundle.json","state":"https://pith.science/pith/SQMYL5ZGUHDT3ZKMWM3I33THGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQMYL5ZGUHDT3ZKMWM3I33THGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SQMYL5ZGUHDT3ZKMWM3I33THGO","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":"1760a45424be1bb28a7b7f1759f2d776ead14059e037077def5e6fca82745ccf","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-08-15T22:24:33Z","title_canon_sha256":"8c9a469a2a9ec81d951c4186bcde23bc5f68f257de456e5156ae28cd71a07dd1"},"schema_version":"1.0","source":{"id":"1508.03774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03774","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03774v1","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03774","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"SQMYL5ZGUHDT","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SQMYL5ZGUHDT3ZKM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SQMYL5ZG","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:910617ae7d8d82d10d6713505d7a380ee15226d1bc46c333f886b6dc59ef1d2c","target":"graph","created_at":"2026-05-18T01:09:11Z","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":"A central theme in phylogenetics is the reconstruction and analysis of evolutionary trees from a given set of data. To determine the optimal search methods for reconstructing trees, it is crucial to understand the size and structure of the neighbourhoods of trees under tree rearrangement operations. The diameter and size of the immediate neighbourhood of a tree has been well-studied, however little is known about the number of trees at distance two, three or (more generally) $k$ from a given tree. In this paper we provide a number of exact and asymptotic results concerning these quantities, an","authors_text":"Jamie V. de Jong, Jeanette C McLeod, Mike Steel","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-08-15T22:24:33Z","title":"Neighbourhoods of phylogenetic trees: exact and asymptotic counts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03774","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:88702d08d507dff36c6ac5c2cecf49c5bb77d3d7cd6213c7ba87deaf53710242","target":"record","created_at":"2026-05-18T01:09:11Z","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":"1760a45424be1bb28a7b7f1759f2d776ead14059e037077def5e6fca82745ccf","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-08-15T22:24:33Z","title_canon_sha256":"8c9a469a2a9ec81d951c4186bcde23bc5f68f257de456e5156ae28cd71a07dd1"},"schema_version":"1.0","source":{"id":"1508.03774","kind":"arxiv","version":1}},"canonical_sha256":"941985f726a1c73de54cb3368dee6733bd52424f47d99c50d5b8da041989d195","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"941985f726a1c73de54cb3368dee6733bd52424f47d99c50d5b8da041989d195","first_computed_at":"2026-05-18T01:09:11.905904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:11.905904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DfE9QK0zRsOxxvyisdiAP2KsDO2YmEoUKFazzZVAwGzZQpz5WEr91TK1qgMnhBL5MLtmU+xRht505pgqIuYWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:11.906522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88702d08d507dff36c6ac5c2cecf49c5bb77d3d7cd6213c7ba87deaf53710242","sha256:910617ae7d8d82d10d6713505d7a380ee15226d1bc46c333f886b6dc59ef1d2c"],"state_sha256":"5a09dfa6e190c88d3db98080c9f72986db98914ee4ff4c374deaf2156e51db98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V7ihPi6JfHw85ON47mzVLLmpcC2hC739d0snN404WR6QNdHQK+Fsd4VQnV6yA7LgZbIM6ofwfgw1LkZ+XG4NCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:33:33.768608Z","bundle_sha256":"9abd7b3639faf2bbb1360c87d75260cd06e3ddb7e1730b239e006a22d86814fe"}}