{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ISII62LS54NTGWNFY3N4P4KMIJ","short_pith_number":"pith:ISII62LS","schema_version":"1.0","canonical_sha256":"44908f6972ef1b3359a5c6dbc7f14c424578bbfe2d569541c6e69591125e3373","source":{"kind":"arxiv","id":"1602.07432","version":2},"attestation_state":"computed","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)"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.07432","created_at":"2026-05-18T01:19:33.703226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07432v2","created_at":"2026-05-18T01:19:33.703226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07432","created_at":"2026-05-18T01:19:33.703226+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISII62LS54NT","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISII62LS54NTGWNF","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISII62LS","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ","json":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ.json","graph_json":"https://pith.science/api/pith-number/ISII62LS54NTGWNFY3N4P4KMIJ/graph.json","events_json":"https://pith.science/api/pith-number/ISII62LS54NTGWNFY3N4P4KMIJ/events.json","paper":"https://pith.science/paper/ISII62LS"},"agent_actions":{"view_html":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ","download_json":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ.json","view_paper":"https://pith.science/paper/ISII62LS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07432&json=true","fetch_graph":"https://pith.science/api/pith-number/ISII62LS54NTGWNFY3N4P4KMIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ISII62LS54NTGWNFY3N4P4KMIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ/action/storage_attestation","attest_author":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ/action/author_attestation","sign_citation":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ/action/citation_signature","submit_replication":"https://pith.science/pith/ISII62LS54NTGWNFY3N4P4KMIJ/action/replication_record"}},"created_at":"2026-05-18T01:19:33.703226+00:00","updated_at":"2026-05-18T01:19:33.703226+00:00"}