{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OKNXMVE74UHM2VVIDYMAGWXL2R","short_pith_number":"pith:OKNXMVE7","schema_version":"1.0","canonical_sha256":"729b76549fe50ecd56a81e18035aebd4685db09fe372ee0f894511da84357d2a","source":{"kind":"arxiv","id":"2411.17613","version":1},"attestation_state":"computed","paper":{"title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GR","math.PR"],"primary_cat":"math.CO","authors_text":"Laurent Bartholdi, Persi Diaconis","submitted_at":"2024-11-26T17:27:09Z","abstract_excerpt":"P\\'olya trees are rooted, unlabeled trees on $n$ vertices. This paper gives an efficient, new way to generate P\\'olya trees. This allows comparing typical unlabeled and labeled tree statistics and comparing asymptotic theorems with `reality'.\n  Along the way, we give a product formula for the number of rooted labeled trees preserved by a given automorphism; this refines Cayley's formula."},"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":"2411.17613","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T17:27:09Z","cross_cats_sorted":["math.GR","math.PR"],"title_canon_sha256":"738d910268538fbbef92f77ca6de13eb09d5c8893a0f3e1e0ce737d1c006e764","abstract_canon_sha256":"1fd54c57d4dff903cd5257bcb8734fdf5208af01c5f2ce3d0984ca89cd9db1f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:49.527178Z","signature_b64":"2w4TJ/dKL4ZAgRTTBKBg0crRMhft7hDexzDS7IcMK7IlLiqjXJWhaTCVhvvtn/BRX0fjG0RaMb53wFQ6wWVPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"729b76549fe50ecd56a81e18035aebd4685db09fe372ee0f894511da84357d2a","last_reissued_at":"2026-07-05T09:40:49.526748Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:49.526748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GR","math.PR"],"primary_cat":"math.CO","authors_text":"Laurent Bartholdi, Persi Diaconis","submitted_at":"2024-11-26T17:27:09Z","abstract_excerpt":"P\\'olya trees are rooted, unlabeled trees on $n$ vertices. This paper gives an efficient, new way to generate P\\'olya trees. This allows comparing typical unlabeled and labeled tree statistics and comparing asymptotic theorems with `reality'.\n  Along the way, we give a product formula for the number of rooted labeled trees preserved by a given automorphism; this refines Cayley's formula."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17613","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17613/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.17613","created_at":"2026-07-05T09:40:49.526803+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17613v1","created_at":"2026-07-05T09:40:49.526803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17613","created_at":"2026-07-05T09:40:49.526803+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKNXMVE74UHM","created_at":"2026-07-05T09:40:49.526803+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKNXMVE74UHM2VVI","created_at":"2026-07-05T09:40:49.526803+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKNXMVE7","created_at":"2026-07-05T09:40:49.526803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.25202","citing_title":"The dual Burnside process","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06471","citing_title":"Leap generators for composition schemes","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OKNXMVE74UHM2VVIDYMAGWXL2R","json":"https://pith.science/pith/OKNXMVE74UHM2VVIDYMAGWXL2R.json","graph_json":"https://pith.science/api/pith-number/OKNXMVE74UHM2VVIDYMAGWXL2R/graph.json","events_json":"https://pith.science/api/pith-number/OKNXMVE74UHM2VVIDYMAGWXL2R/events.json","paper":"https://pith.science/paper/OKNXMVE7"},"agent_actions":{"view_html":"https://pith.science/pith/OKNXMVE74UHM2VVIDYMAGWXL2R","download_json":"https://pith.science/pith/OKNXMVE74UHM2VVIDYMAGWXL2R.json","view_paper":"https://pith.science/paper/OKNXMVE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17613&json=true","fetch_graph":"https://pith.science/api/pith-number/OKNXMVE74UHM2VVIDYMAGWXL2R/graph.json","fetch_events":"https://pith.science/api/pith-number/OKNXMVE74UHM2VVIDYMAGWXL2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKNXMVE74UHM2VVIDYMAGWXL2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKNXMVE74UHM2VVIDYMAGWXL2R/action/storage_attestation","attest_author":"https://pith.science/pith/OKNXMVE74UHM2VVIDYMAGWXL2R/action/author_attestation","sign_citation":"https://pith.science/pith/OKNXMVE74UHM2VVIDYMAGWXL2R/action/citation_signature","submit_replication":"https://pith.science/pith/OKNXMVE74UHM2VVIDYMAGWXL2R/action/replication_record"}},"created_at":"2026-07-05T09:40:49.526803+00:00","updated_at":"2026-07-05T09:40:49.526803+00:00"}