{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:VW4CFAXYU2VYAQCHAJJGZNXBMI","short_pith_number":"pith:VW4CFAXY","schema_version":"1.0","canonical_sha256":"adb82282f8a6ab80404702526cb6e1620e5d1374dc35ef0f17bfe624a13f423e","source":{"kind":"arxiv","id":"0906.5553","version":1},"attestation_state":"computed","paper":{"title":"Random $k$-noncrossing RNA Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Christian M. Reidys, Hillary S.W. Han, William Y.C. Chen","submitted_at":"2009-06-30T14:54:40Z","abstract_excerpt":"In this paper we derive polynomial time algorithms that generate random $k$-noncrossing matchings and $k$-noncrossing RNA structures with uniform probability. Our approach employs the bijection between $k$-noncrossing matchings and oscillating tableaux and the $P$-recursiveness of the cardinalities of $k$-noncrossing matchings. The main idea is to consider the tableaux sequences as paths of stochastic processes over shapes and to derive their transition probabilities."},"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":"0906.5553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-06-30T14:54:40Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e9b450cec92e9784d1c5863c262ce4d1c61b1eff56dc85e7b74f3b8e72e6793e","abstract_canon_sha256":"aaa2d39403b91f1b14647884c8881b044e482570479a8ef04e2b0a6e9b1101f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:13:11.698489Z","signature_b64":"b7yvVQ/5IvYgyHOUtgJvqldHBzWruMWwrI9JKRBE+rKcVH/EIHLRRCJgM5D9r6NYlSIm1S2AjLGs4ECkdRk7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adb82282f8a6ab80404702526cb6e1620e5d1374dc35ef0f17bfe624a13f423e","last_reissued_at":"2026-05-18T02:13:11.697978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:13:11.697978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random $k$-noncrossing RNA Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Christian M. Reidys, Hillary S.W. Han, William Y.C. Chen","submitted_at":"2009-06-30T14:54:40Z","abstract_excerpt":"In this paper we derive polynomial time algorithms that generate random $k$-noncrossing matchings and $k$-noncrossing RNA structures with uniform probability. Our approach employs the bijection between $k$-noncrossing matchings and oscillating tableaux and the $P$-recursiveness of the cardinalities of $k$-noncrossing matchings. The main idea is to consider the tableaux sequences as paths of stochastic processes over shapes and to derive their transition probabilities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.5553","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0906.5553","created_at":"2026-05-18T02:13:11.698063+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.5553v1","created_at":"2026-05-18T02:13:11.698063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.5553","created_at":"2026-05-18T02:13:11.698063+00:00"},{"alias_kind":"pith_short_12","alias_value":"VW4CFAXYU2VY","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"VW4CFAXYU2VYAQCH","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"VW4CFAXY","created_at":"2026-05-18T12:26:02.257875+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/VW4CFAXYU2VYAQCHAJJGZNXBMI","json":"https://pith.science/pith/VW4CFAXYU2VYAQCHAJJGZNXBMI.json","graph_json":"https://pith.science/api/pith-number/VW4CFAXYU2VYAQCHAJJGZNXBMI/graph.json","events_json":"https://pith.science/api/pith-number/VW4CFAXYU2VYAQCHAJJGZNXBMI/events.json","paper":"https://pith.science/paper/VW4CFAXY"},"agent_actions":{"view_html":"https://pith.science/pith/VW4CFAXYU2VYAQCHAJJGZNXBMI","download_json":"https://pith.science/pith/VW4CFAXYU2VYAQCHAJJGZNXBMI.json","view_paper":"https://pith.science/paper/VW4CFAXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.5553&json=true","fetch_graph":"https://pith.science/api/pith-number/VW4CFAXYU2VYAQCHAJJGZNXBMI/graph.json","fetch_events":"https://pith.science/api/pith-number/VW4CFAXYU2VYAQCHAJJGZNXBMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VW4CFAXYU2VYAQCHAJJGZNXBMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VW4CFAXYU2VYAQCHAJJGZNXBMI/action/storage_attestation","attest_author":"https://pith.science/pith/VW4CFAXYU2VYAQCHAJJGZNXBMI/action/author_attestation","sign_citation":"https://pith.science/pith/VW4CFAXYU2VYAQCHAJJGZNXBMI/action/citation_signature","submit_replication":"https://pith.science/pith/VW4CFAXYU2VYAQCHAJJGZNXBMI/action/replication_record"}},"created_at":"2026-05-18T02:13:11.698063+00:00","updated_at":"2026-05-18T02:13:11.698063+00:00"}