{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PSZ2HLP6X2QU74M6WKU5WYVCKC","short_pith_number":"pith:PSZ2HLP6","schema_version":"1.0","canonical_sha256":"7cb3a3adfebea14ff19eb2a9db62a2509998e5de568428dfdf7878b5b5e1cf25","source":{"kind":"arxiv","id":"1401.4712","version":1},"attestation_state":"computed","paper":{"title":"Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"David Julien (LIPN), Marchal Philippe (LAGA), Olivier Bodini (LIPN)","submitted_at":"2014-01-19T18:17:01Z","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.)"},"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":"1401.4712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-19T18:17:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"64a10ae7ff1a2ec53930d9efaf6118983af15571c8f9c8c3730fe7bc242c4f94","abstract_canon_sha256":"9a67bf7efef0ebee4ebfbc4f5adc189b574bab803213d23d4cd5aaa3380e3202"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:44.855496Z","signature_b64":"5U9cBmRGukJSEgWzxdmYQX58iGxRzrf/2RtDL7Rr8AdxLPXePrMiwlzG69su63huAicKe0C0sg0FaICrpx8oDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cb3a3adfebea14ff19eb2a9db62a2509998e5de568428dfdf7878b5b5e1cf25","last_reissued_at":"2026-05-18T03:01:44.854903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:44.854903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"David Julien (LIPN), Marchal Philippe (LAGA), Olivier Bodini (LIPN)","submitted_at":"2014-01-19T18:17:01Z","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.)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4712","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.4712","created_at":"2026-05-18T03:01:44.855000+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4712v1","created_at":"2026-05-18T03:01:44.855000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4712","created_at":"2026-05-18T03:01:44.855000+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSZ2HLP6X2QU","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSZ2HLP6X2QU74M6","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSZ2HLP6","created_at":"2026-05-18T12:28:43.426989+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/PSZ2HLP6X2QU74M6WKU5WYVCKC","json":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC.json","graph_json":"https://pith.science/api/pith-number/PSZ2HLP6X2QU74M6WKU5WYVCKC/graph.json","events_json":"https://pith.science/api/pith-number/PSZ2HLP6X2QU74M6WKU5WYVCKC/events.json","paper":"https://pith.science/paper/PSZ2HLP6"},"agent_actions":{"view_html":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC","download_json":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC.json","view_paper":"https://pith.science/paper/PSZ2HLP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4712&json=true","fetch_graph":"https://pith.science/api/pith-number/PSZ2HLP6X2QU74M6WKU5WYVCKC/graph.json","fetch_events":"https://pith.science/api/pith-number/PSZ2HLP6X2QU74M6WKU5WYVCKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC/action/storage_attestation","attest_author":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC/action/author_attestation","sign_citation":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC/action/citation_signature","submit_replication":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC/action/replication_record"}},"created_at":"2026-05-18T03:01:44.855000+00:00","updated_at":"2026-05-18T03:01:44.855000+00:00"}