{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PSZ2HLP6X2QU74M6WKU5WYVCKC","short_pith_number":"pith:PSZ2HLP6","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"},"canonical_sha256":"7cb3a3adfebea14ff19eb2a9db62a2509998e5de568428dfdf7878b5b5e1cf25","source":{"kind":"arxiv","id":"1401.4712","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PSZ2HLP6X2QU74M6WKU5WYVCKC","target":"record","payload":{"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"},"canonical_sha256":"7cb3a3adfebea14ff19eb2a9db62a2509998e5de568428dfdf7878b5b5e1cf25","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"},"source_kind":"arxiv","source_id":"1401.4712","source_version":1,"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-18T03:01:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fxUuyBNhpGE4HqPbvtrW4ZTzmSoJgJx6HFC45/9qMpk4JtmfC0lEQAEnmilRZXG5EsOFKl5UewkBUkMu+7URBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:53:00.785028Z"},"content_sha256":"892b98276c6f1d6b518a9eca5fb0653585e86d73e24e977365af1f0f1aa44c31","schema_version":"1.0","event_id":"sha256:892b98276c6f1d6b518a9eca5fb0653585e86d73e24e977365af1f0f1aa44c31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PSZ2HLP6X2QU74M6WKU5WYVCKC","target":"graph","payload":{"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"},"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-18T03:01:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSi+Mpkl9zrBsqwDUb1MM+LGbaik/XQ9kkYPFpaqirsBgTjRibm46l7TboU3fYL3tU8FFjyzJuYS2oUiLUpsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:53:00.785377Z"},"content_sha256":"ed306c809c6356636df624eb4512939b956acc47abd2f12a4d3f5db239c8bb47","schema_version":"1.0","event_id":"sha256:ed306c809c6356636df624eb4512939b956acc47abd2f12a4d3f5db239c8bb47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC/bundle.json","state_url":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC/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-24T17:53:00Z","links":{"resolver":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC","bundle":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC/bundle.json","state":"https://pith.science/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSZ2HLP6X2QU74M6WKU5WYVCKC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tyjR5r77OkoQLq/nk2B6yOhD4IYs5Xz3P8i0C7cQOZMWZc6WB8hgm33HeJQIgpeyMgYxgeFXWCnxAtOybZ+8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:53:00.787277Z","bundle_sha256":"27546cdbf1e4ec80ccbf3c04bb787b8b287c5d7afb7c487375cd4a76c202d4f7"}}