{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PSZ2HLP6X2QU74M6WKU5WYVCKC","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":"9a67bf7efef0ebee4ebfbc4f5adc189b574bab803213d23d4cd5aaa3380e3202","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-19T18:17:01Z","title_canon_sha256":"64a10ae7ff1a2ec53930d9efaf6118983af15571c8f9c8c3730fe7bc242c4f94"},"schema_version":"1.0","source":{"id":"1401.4712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4712","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4712v1","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4712","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"pith_short_12","alias_value":"PSZ2HLP6X2QU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PSZ2HLP6X2QU74M6","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PSZ2HLP6","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:ed306c809c6356636df624eb4512939b956acc47abd2f12a4d3f5db239c8bb47","target":"graph","created_at":"2026-05-18T03:01:44Z","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":"In this paper, we redesign and simplify an algorithm due to Remy et al. for the generation of rooted planar trees that satisfies a given partition of degrees. This new version is now optimal in terms of random bit complexity, up to a multiplicative constant. We then apply a natural process \"simulate-guess-and-proof\" to analyze the height of a random Motzkin in function of its frequency of unary nodes. When the number of unary nodes dominates, we prove some unconventional height phenomenon (i.e. outside the universal square root behaviour.)","authors_text":"David Julien (LIPN), Marchal Philippe (LAGA), Olivier Bodini (LIPN)","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-19T18:17:01Z","title":"Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4712","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:892b98276c6f1d6b518a9eca5fb0653585e86d73e24e977365af1f0f1aa44c31","target":"record","created_at":"2026-05-18T03:01:44Z","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":"9a67bf7efef0ebee4ebfbc4f5adc189b574bab803213d23d4cd5aaa3380e3202","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-19T18:17:01Z","title_canon_sha256":"64a10ae7ff1a2ec53930d9efaf6118983af15571c8f9c8c3730fe7bc242c4f94"},"schema_version":"1.0","source":{"id":"1401.4712","kind":"arxiv","version":1}},"canonical_sha256":"7cb3a3adfebea14ff19eb2a9db62a2509998e5de568428dfdf7878b5b5e1cf25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cb3a3adfebea14ff19eb2a9db62a2509998e5de568428dfdf7878b5b5e1cf25","first_computed_at":"2026-05-18T03:01:44.854903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:44.854903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5U9cBmRGukJSEgWzxdmYQX58iGxRzrf/2RtDL7Rr8AdxLPXePrMiwlzG69su63huAicKe0C0sg0FaICrpx8oDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:44.855496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:892b98276c6f1d6b518a9eca5fb0653585e86d73e24e977365af1f0f1aa44c31","sha256:ed306c809c6356636df624eb4512939b956acc47abd2f12a4d3f5db239c8bb47"],"state_sha256":"a7558693a9b17dd49f864c422326d92502b16e462499b65a55082dca6e3d3891"}