{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2I7B6E64S7Q25MKGDEX76WDWPS","short_pith_number":"pith:2I7B6E64","schema_version":"1.0","canonical_sha256":"d23e1f13dc97e1aeb146192fff58767c9087104238ae5db7d428590a92e36a80","source":{"kind":"arxiv","id":"2606.13151","version":1},"attestation_state":"computed","paper":{"title":"Random Generation of $k$-coloured Motzkin Paths","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Antonio Bernini (University of Florence), Elena Barcucci (University of Florence), Renzo Pinzani (University of Florence), Stefano Bilotta (University of Florence)","submitted_at":"2026-06-11T10:26:29Z","abstract_excerpt":"We study k-coloured Motzkin paths, namely Motzkin paths in which horizontal steps can be coloured in k different ways, and investigate their connection with the number of prefixes ending at odd height from both an analytical and a combinatorial point of view. Moreover, the combinatorial approach provides a random generation algorithm for k-coloured Motzkin paths in linear-time."},"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":"2606.13151","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T10:26:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1d260ca1ec3eff445665c6bd085252b844beccaeb33bd0d4b55c445fe5f40887","abstract_canon_sha256":"070c1a53ca3457798da6c895d4b49c83f3f4264afbac66ca8c08e38fb8437163"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:43.250354Z","signature_b64":"B7MK5bM9ExoaCyYWjzmpKRkL2xB2knkqbNZph+1sXpr1pXpLQLmf6njLTnA66Xo5nQk+ytrDYyJmFNDwL0DoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d23e1f13dc97e1aeb146192fff58767c9087104238ae5db7d428590a92e36a80","last_reissued_at":"2026-06-12T01:09:43.249420Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:43.249420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Generation of $k$-coloured Motzkin Paths","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Antonio Bernini (University of Florence), Elena Barcucci (University of Florence), Renzo Pinzani (University of Florence), Stefano Bilotta (University of Florence)","submitted_at":"2026-06-11T10:26:29Z","abstract_excerpt":"We study k-coloured Motzkin paths, namely Motzkin paths in which horizontal steps can be coloured in k different ways, and investigate their connection with the number of prefixes ending at odd height from both an analytical and a combinatorial point of view. Moreover, the combinatorial approach provides a random generation algorithm for k-coloured Motzkin paths in linear-time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13151","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.13151/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.13151","created_at":"2026-06-12T01:09:43.249547+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.13151v1","created_at":"2026-06-12T01:09:43.249547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13151","created_at":"2026-06-12T01:09:43.249547+00:00"},{"alias_kind":"pith_short_12","alias_value":"2I7B6E64S7Q2","created_at":"2026-06-12T01:09:43.249547+00:00"},{"alias_kind":"pith_short_16","alias_value":"2I7B6E64S7Q25MKG","created_at":"2026-06-12T01:09:43.249547+00:00"},{"alias_kind":"pith_short_8","alias_value":"2I7B6E64","created_at":"2026-06-12T01:09:43.249547+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/2I7B6E64S7Q25MKGDEX76WDWPS","json":"https://pith.science/pith/2I7B6E64S7Q25MKGDEX76WDWPS.json","graph_json":"https://pith.science/api/pith-number/2I7B6E64S7Q25MKGDEX76WDWPS/graph.json","events_json":"https://pith.science/api/pith-number/2I7B6E64S7Q25MKGDEX76WDWPS/events.json","paper":"https://pith.science/paper/2I7B6E64"},"agent_actions":{"view_html":"https://pith.science/pith/2I7B6E64S7Q25MKGDEX76WDWPS","download_json":"https://pith.science/pith/2I7B6E64S7Q25MKGDEX76WDWPS.json","view_paper":"https://pith.science/paper/2I7B6E64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.13151&json=true","fetch_graph":"https://pith.science/api/pith-number/2I7B6E64S7Q25MKGDEX76WDWPS/graph.json","fetch_events":"https://pith.science/api/pith-number/2I7B6E64S7Q25MKGDEX76WDWPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2I7B6E64S7Q25MKGDEX76WDWPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2I7B6E64S7Q25MKGDEX76WDWPS/action/storage_attestation","attest_author":"https://pith.science/pith/2I7B6E64S7Q25MKGDEX76WDWPS/action/author_attestation","sign_citation":"https://pith.science/pith/2I7B6E64S7Q25MKGDEX76WDWPS/action/citation_signature","submit_replication":"https://pith.science/pith/2I7B6E64S7Q25MKGDEX76WDWPS/action/replication_record"}},"created_at":"2026-06-12T01:09:43.249547+00:00","updated_at":"2026-06-12T01:09:43.249547+00:00"}