{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ISII62LS54NTGWNFY3N4P4KMIJ","short_pith_number":"pith:ISII62LS","canonical_record":{"source":{"id":"1602.07432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T08:48:07Z","cross_cats_sorted":[],"title_canon_sha256":"d957c1b112ed4c17d8e0fa3d551641d85c7ae0caa28cd0717807730bdac22203","abstract_canon_sha256":"118765190d9b256c99599c4b80b2b03d347521925e314c12ed644ee2b3980470"},"schema_version":"1.0"},"canonical_sha256":"44908f6972ef1b3359a5c6dbc7f14c424578bbfe2d569541c6e69591125e3373","source":{"kind":"arxiv","id":"1602.07432","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07432","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07432v2","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07432","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"ISII62LS54NT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ISII62LS54NTGWNF","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ISII62LS","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ISII62LS54NTGWNFY3N4P4KMIJ","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T08:48:07Z","cross_cats_sorted":[],"title_canon_sha256":"d957c1b112ed4c17d8e0fa3d551641d85c7ae0caa28cd0717807730bdac22203","abstract_canon_sha256":"118765190d9b256c99599c4b80b2b03d347521925e314c12ed644ee2b3980470"},"schema_version":"1.0"},"canonical_sha256":"44908f6972ef1b3359a5c6dbc7f14c424578bbfe2d569541c6e69591125e3373","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:33.703561Z","signature_b64":"VtZacWxsfnNpMzSO2cJkBafNJIkESwSyp7X5lXlJ7ON2GA8EHDY/+awYUsqAMEB2BkAq8Ec2kVCnbdVqbZKEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44908f6972ef1b3359a5c6dbc7f14c424578bbfe2d569541c6e69591125e3373","last_reissued_at":"2026-05-18T01:19:33.703164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:33.703164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07432","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-18T01:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+n6lWCiplgtQ4T2s072LjjapYzPmlMOjSIINxQxQJowYW4KF9h42DDDABwvg930+OpKCbB9l1xM5HdkLYEOlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:59:24.588008Z"},"content_sha256":"b7196f26bde2b7058da21635bce8e98947b6237ea8278a47454f15c5e969b515","schema_version":"1.0","event_id":"sha256:b7196f26bde2b7058da21635bce8e98947b6237ea8278a47454f15c5e969b515"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ISII62LS54NTGWNFY3N4P4KMIJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On symmetries in phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Eric Fusy","submitted_at":"2016-02-24T08:48:07Z","abstract_excerpt":"Billey et al. [arXiv:1507.04976] have recently discovered a surprisingly simple formula for the number $a_n(\\sigma)$ of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) with $n\\geq 1$ leaves, fixed (for the relabelling action) by a given permutation $\\sigma\\in\\frak{S}_n$. Denoting by $\\lambda\\vdash n$ the integer partition giving the sizes of the cycles of $\\sigma$ in non-increasing order, they show by a guessing/checking approach that if $\\lambda$ is a binary partition (it is known that $a_n(\\sigma)=0$ otherwise), then $$ a_n(\\sigma)=\\prod_{i=2}^{\\ell(\\lambda)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07432","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-18T01:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1GuSEPVhC4vrurTJoCnGO0qjBpQ68vEOdvCB3btNZw9URX6TODbhEy9PCmOg0GzJyibHZdbuhK3TUgClGApyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:59:24.588683Z"},"content_sha256":"178874b87f0b915eaf589f258ef68adc8fea414427e71e587e7628eaff662b12","schema_version":"1.0","event_id":"sha256:178874b87f0b915eaf589f258ef68adc8fea414427e71e587e7628eaff662b12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ/bundle.json","state_url":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISII62LS54NTGWNFY3N4P4KMIJ/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-06T18:59:24Z","links":{"resolver":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ","bundle":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ/bundle.json","state":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISII62LS54NTGWNFY3N4P4KMIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ISII62LS54NTGWNFY3N4P4KMIJ","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":"118765190d9b256c99599c4b80b2b03d347521925e314c12ed644ee2b3980470","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T08:48:07Z","title_canon_sha256":"d957c1b112ed4c17d8e0fa3d551641d85c7ae0caa28cd0717807730bdac22203"},"schema_version":"1.0","source":{"id":"1602.07432","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07432","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07432v2","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07432","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"ISII62LS54NT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ISII62LS54NTGWNF","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ISII62LS","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:178874b87f0b915eaf589f258ef68adc8fea414427e71e587e7628eaff662b12","target":"graph","created_at":"2026-05-18T01:19:33Z","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":"Billey et al. [arXiv:1507.04976] have recently discovered a surprisingly simple formula for the number $a_n(\\sigma)$ of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) with $n\\geq 1$ leaves, fixed (for the relabelling action) by a given permutation $\\sigma\\in\\frak{S}_n$. Denoting by $\\lambda\\vdash n$ the integer partition giving the sizes of the cycles of $\\sigma$ in non-increasing order, they show by a guessing/checking approach that if $\\lambda$ is a binary partition (it is known that $a_n(\\sigma)=0$ otherwise), then $$ a_n(\\sigma)=\\prod_{i=2}^{\\ell(\\lambda)","authors_text":"\\'Eric Fusy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T08:48:07Z","title":"On symmetries in phylogenetic trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07432","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:b7196f26bde2b7058da21635bce8e98947b6237ea8278a47454f15c5e969b515","target":"record","created_at":"2026-05-18T01:19:33Z","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":"118765190d9b256c99599c4b80b2b03d347521925e314c12ed644ee2b3980470","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T08:48:07Z","title_canon_sha256":"d957c1b112ed4c17d8e0fa3d551641d85c7ae0caa28cd0717807730bdac22203"},"schema_version":"1.0","source":{"id":"1602.07432","kind":"arxiv","version":2}},"canonical_sha256":"44908f6972ef1b3359a5c6dbc7f14c424578bbfe2d569541c6e69591125e3373","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44908f6972ef1b3359a5c6dbc7f14c424578bbfe2d569541c6e69591125e3373","first_computed_at":"2026-05-18T01:19:33.703164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:33.703164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VtZacWxsfnNpMzSO2cJkBafNJIkESwSyp7X5lXlJ7ON2GA8EHDY/+awYUsqAMEB2BkAq8Ec2kVCnbdVqbZKEBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:33.703561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07432","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7196f26bde2b7058da21635bce8e98947b6237ea8278a47454f15c5e969b515","sha256:178874b87f0b915eaf589f258ef68adc8fea414427e71e587e7628eaff662b12"],"state_sha256":"1a49d041a97b73c2b2c753e143bd6a2846aad0f211932b847fa9a00ab6dfa907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4w6cyWB+suu/PKKroWSMDgdzSvhXhfUFp0+ZUkPtsceA8eYG2QzDtYxtb/eGU4autP6fCFRyoeQCKnylsSjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:59:24.592155Z","bundle_sha256":"76bae2df30234a6785d62333610baeea0f0a45d44f75cb26986dcd043d55cae6"}}