{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7BO3AIU73MFYA365DECT6Y6J4Z","short_pith_number":"pith:7BO3AIU7","schema_version":"1.0","canonical_sha256":"f85db0229fdb0b806fdd19053f63c9e6423381ba5ae10c0e60ec87b78cd9b80a","source":{"kind":"arxiv","id":"1603.06290","version":2},"attestation_state":"computed","paper":{"title":"A new bijection on m-Dyck paths with application to random sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Axel Bacher","submitted_at":"2016-03-20T23:37:32Z","abstract_excerpt":"We present a new bijection between variants of $m$-Dyck paths (paths with steps in $\\{+1,-m\\}$ starting and ending at height $0$ and remaining at non-negative height), which generalizes a classical bijection between Dyck prefixes and pointed {\\L}ukasiewicz paths. As an application, we present a new random sampling procedure for $m$-Dyck paths with a linear time complexity and using a quasi-optimal number of random bits. This outperforms Devroye's algorithm, which uses $\\mathcal O(n\\log n)$ random bits."},"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":"1603.06290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-20T23:37:32Z","cross_cats_sorted":[],"title_canon_sha256":"fd256c3397a14fb990d5264eccd7011482814a8ed4fda868d976a9fbee1a0251","abstract_canon_sha256":"83f0b30a5bf312d2d9cd1471602ae64f227d5f55dcd6834ea5739655c483aa4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:13.667345Z","signature_b64":"FK1Cha1AzVpjMWtsVcewPVhwaDxUcw8Os7r8Gkk1PM31nMnG7S/0q0o5D7/+qf3NXQELlZKvaPkUudy/sTN8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f85db0229fdb0b806fdd19053f63c9e6423381ba5ae10c0e60ec87b78cd9b80a","last_reissued_at":"2026-05-18T01:18:13.666636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:13.666636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new bijection on m-Dyck paths with application to random sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Axel Bacher","submitted_at":"2016-03-20T23:37:32Z","abstract_excerpt":"We present a new bijection between variants of $m$-Dyck paths (paths with steps in $\\{+1,-m\\}$ starting and ending at height $0$ and remaining at non-negative height), which generalizes a classical bijection between Dyck prefixes and pointed {\\L}ukasiewicz paths. As an application, we present a new random sampling procedure for $m$-Dyck paths with a linear time complexity and using a quasi-optimal number of random bits. This outperforms Devroye's algorithm, which uses $\\mathcal O(n\\log n)$ random bits."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06290","kind":"arxiv","version":2},"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":"1603.06290","created_at":"2026-05-18T01:18:13.666743+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06290v2","created_at":"2026-05-18T01:18:13.666743+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06290","created_at":"2026-05-18T01:18:13.666743+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BO3AIU73MFY","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BO3AIU73MFYA365","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BO3AIU7","created_at":"2026-05-18T12:30:04.600751+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/7BO3AIU73MFYA365DECT6Y6J4Z","json":"https://pith.science/pith/7BO3AIU73MFYA365DECT6Y6J4Z.json","graph_json":"https://pith.science/api/pith-number/7BO3AIU73MFYA365DECT6Y6J4Z/graph.json","events_json":"https://pith.science/api/pith-number/7BO3AIU73MFYA365DECT6Y6J4Z/events.json","paper":"https://pith.science/paper/7BO3AIU7"},"agent_actions":{"view_html":"https://pith.science/pith/7BO3AIU73MFYA365DECT6Y6J4Z","download_json":"https://pith.science/pith/7BO3AIU73MFYA365DECT6Y6J4Z.json","view_paper":"https://pith.science/paper/7BO3AIU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06290&json=true","fetch_graph":"https://pith.science/api/pith-number/7BO3AIU73MFYA365DECT6Y6J4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/7BO3AIU73MFYA365DECT6Y6J4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BO3AIU73MFYA365DECT6Y6J4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BO3AIU73MFYA365DECT6Y6J4Z/action/storage_attestation","attest_author":"https://pith.science/pith/7BO3AIU73MFYA365DECT6Y6J4Z/action/author_attestation","sign_citation":"https://pith.science/pith/7BO3AIU73MFYA365DECT6Y6J4Z/action/citation_signature","submit_replication":"https://pith.science/pith/7BO3AIU73MFYA365DECT6Y6J4Z/action/replication_record"}},"created_at":"2026-05-18T01:18:13.666743+00:00","updated_at":"2026-05-18T01:18:13.666743+00:00"}