{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CER5NVLXZ7ALAULSH3SVXHFMU5","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":"c8635d0bb39b8b603ea9143bfdf2da4e136de006e1b3c70d177620c339f409a8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-06T17:04:52Z","title_canon_sha256":"0ca0bb347467d6e0565186050629d6e8a162e1b8283503df906ff91e8442437d"},"schema_version":"1.0","source":{"id":"1401.1140","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1140","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1140v2","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1140","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"CER5NVLXZ7AL","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CER5NVLXZ7ALAULS","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CER5NVLX","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:b81150f72086c8bd7526549a1da17a0edd83d3b807992f55b5447f03fc01da3e","target":"graph","created_at":"2026-05-18T00:23:09Z","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":"We present a new uniform random sampler for binary trees with $n$ internal nodes consuming $2n + \\Theta(\\log(n)^2)$ random bits on average. This makes it quasi-optimal and out-performs the classical Remy algorithm. We also present a sampler for unary-binary trees with $n$ nodes taking $\\Theta(n)$ random bits on average. Both are the first linear-time algorithms to be optimal up to a constant.","authors_text":"Alice Jacquot, Axel Bacher, Olivier Bodini","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-06T17:04:52Z","title":"Efficient random sampling of binary and unary-binary trees via holonomic equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1140","kind":"arxiv","version":2},"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:57f2f15ecd87d9c50464bb9220fba27523cf965cab388e80105a387195b203ca","target":"record","created_at":"2026-05-18T00:23:09Z","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":"c8635d0bb39b8b603ea9143bfdf2da4e136de006e1b3c70d177620c339f409a8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-06T17:04:52Z","title_canon_sha256":"0ca0bb347467d6e0565186050629d6e8a162e1b8283503df906ff91e8442437d"},"schema_version":"1.0","source":{"id":"1401.1140","kind":"arxiv","version":2}},"canonical_sha256":"1123d6d577cfc0b051723ee55b9caca7607284a15400f504c618b1879bc2934d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1123d6d577cfc0b051723ee55b9caca7607284a15400f504c618b1879bc2934d","first_computed_at":"2026-05-18T00:23:09.886037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:09.886037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YMrk8JHEnQpRAFraRuKvpFcEhrpGEHLoLEdpikZXgPPvOwBQ+IoFVP6lsPgePka3NCGmjtAAi62N7XHFmJMjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:09.886695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1140","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57f2f15ecd87d9c50464bb9220fba27523cf965cab388e80105a387195b203ca","sha256:b81150f72086c8bd7526549a1da17a0edd83d3b807992f55b5447f03fc01da3e"],"state_sha256":"dc24173b75ab29f086caf4c8c9e441acdb9d8b296dee32daf596306da04c71a1"}