{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TPXXWUVIFHVA7QWCPKSZVF2GNW","short_pith_number":"pith:TPXXWUVI","schema_version":"1.0","canonical_sha256":"9bef7b52a829ea0fc2c27aa59a97466da7a138247a699f50d147f492d7d101b2","source":{"kind":"arxiv","id":"1802.06030","version":2},"attestation_state":"computed","paper":{"title":"Improving the Florentine algorithms: recovering algorithms for Motzkin and Schr\\\"oder paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Axel Bacher","submitted_at":"2018-02-16T17:07:10Z","abstract_excerpt":"We present random sampling procedures for Motzkin and Schr\\\"oder paths, following previous work on Dyck paths. Our algorithms follow the anticipated rejection method of the Florentine algorithms (Barcucci et al. 1994+), but introduce a recovery idea to greatly reduce the probability of rejection. They use an optimal amount of randomness and achieve a better time complexity than the Florentine algorithms."},"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":"1802.06030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-16T17:07:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d7c2b3811ac036da8eea85a0eb7ff7a8e6f4d16af99ea8f826d01909e81a5749","abstract_canon_sha256":"39e9337f6f230dfb6e35334875f372a5e5fb06029841e22e4718564ba540ce8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:01.431019Z","signature_b64":"Wfqva4F1AGTDZRE4clpbDVUr/Zjss7p81IbqSXoQMqFAqWx+0P96cbmbi6KLQcbpcWI8Vu7nbhB5I8c5s1uQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bef7b52a829ea0fc2c27aa59a97466da7a138247a699f50d147f492d7d101b2","last_reissued_at":"2026-05-18T00:21:01.430604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:01.430604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the Florentine algorithms: recovering algorithms for Motzkin and Schr\\\"oder paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Axel Bacher","submitted_at":"2018-02-16T17:07:10Z","abstract_excerpt":"We present random sampling procedures for Motzkin and Schr\\\"oder paths, following previous work on Dyck paths. Our algorithms follow the anticipated rejection method of the Florentine algorithms (Barcucci et al. 1994+), but introduce a recovery idea to greatly reduce the probability of rejection. They use an optimal amount of randomness and achieve a better time complexity than the Florentine algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06030","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":"1802.06030","created_at":"2026-05-18T00:21:01.430665+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06030v2","created_at":"2026-05-18T00:21:01.430665+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06030","created_at":"2026-05-18T00:21:01.430665+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPXXWUVIFHVA","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPXXWUVIFHVA7QWC","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPXXWUVI","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.13151","citing_title":"Random Generation of $k$-coloured Motzkin Paths","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06471","citing_title":"Leap generators for composition schemes","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TPXXWUVIFHVA7QWCPKSZVF2GNW","json":"https://pith.science/pith/TPXXWUVIFHVA7QWCPKSZVF2GNW.json","graph_json":"https://pith.science/api/pith-number/TPXXWUVIFHVA7QWCPKSZVF2GNW/graph.json","events_json":"https://pith.science/api/pith-number/TPXXWUVIFHVA7QWCPKSZVF2GNW/events.json","paper":"https://pith.science/paper/TPXXWUVI"},"agent_actions":{"view_html":"https://pith.science/pith/TPXXWUVIFHVA7QWCPKSZVF2GNW","download_json":"https://pith.science/pith/TPXXWUVIFHVA7QWCPKSZVF2GNW.json","view_paper":"https://pith.science/paper/TPXXWUVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06030&json=true","fetch_graph":"https://pith.science/api/pith-number/TPXXWUVIFHVA7QWCPKSZVF2GNW/graph.json","fetch_events":"https://pith.science/api/pith-number/TPXXWUVIFHVA7QWCPKSZVF2GNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPXXWUVIFHVA7QWCPKSZVF2GNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPXXWUVIFHVA7QWCPKSZVF2GNW/action/storage_attestation","attest_author":"https://pith.science/pith/TPXXWUVIFHVA7QWCPKSZVF2GNW/action/author_attestation","sign_citation":"https://pith.science/pith/TPXXWUVIFHVA7QWCPKSZVF2GNW/action/citation_signature","submit_replication":"https://pith.science/pith/TPXXWUVIFHVA7QWCPKSZVF2GNW/action/replication_record"}},"created_at":"2026-05-18T00:21:01.430665+00:00","updated_at":"2026-05-18T00:21:01.430665+00:00"}