{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:T5QSFWACFV3BSCKLAWBDW47JHF","short_pith_number":"pith:T5QSFWAC","schema_version":"1.0","canonical_sha256":"9f6122d8022d7619094b05823b73e93963a5f6679030e96f358b1fef93d5da9b","source":{"kind":"arxiv","id":"1106.3771","version":1},"attestation_state":"computed","paper":{"title":"A Combinatorial Framework for Designing (Pseudoknotted) RNA Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.QM","authors_text":"C\\'edric Saule (INRIA Saclay - Ile de France, IRIC), LIX), LRI, Yann Ponty (INRIA Saclay - Ile de France","submitted_at":"2011-06-19T18:50:54Z","abstract_excerpt":"We extend an hypergraph representation, introduced by Finkelstein and Roytberg, to unify dynamic programming algorithms in the context of RNA folding with pseudoknots. Classic applications of RNA dynamic programming energy minimization, partition function, base-pair probabilities...) are reformulated within this framework, giving rise to very simple algorithms. This reformulation allows one to conceptually detach the conformation space/energy model -- captured by the hypergraph model -- from the specific application, assuming unambiguity of the decomposition. To ensure the latter property, we "},"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":"1106.3771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-06-19T18:50:54Z","cross_cats_sorted":[],"title_canon_sha256":"324ed506195007b74d493bba1101aaf0e08656aa91d9da32805ed6651eeb7c7b","abstract_canon_sha256":"239ea37317a8b14bce7bf25bf259d43c4a4768620527bc87d4b5ca99262dbbf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:42.218592Z","signature_b64":"tGJk11iS9G+ErwfJsAfibcSauQmAClo8jajv9vftGyPlP7YxTP0rfa7P9rEav28Fkb9h6xmorUDPqNyJ5fdODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f6122d8022d7619094b05823b73e93963a5f6679030e96f358b1fef93d5da9b","last_reissued_at":"2026-05-18T04:19:42.218049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:42.218049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Combinatorial Framework for Designing (Pseudoknotted) RNA Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.QM","authors_text":"C\\'edric Saule (INRIA Saclay - Ile de France, IRIC), LIX), LRI, Yann Ponty (INRIA Saclay - Ile de France","submitted_at":"2011-06-19T18:50:54Z","abstract_excerpt":"We extend an hypergraph representation, introduced by Finkelstein and Roytberg, to unify dynamic programming algorithms in the context of RNA folding with pseudoknots. Classic applications of RNA dynamic programming energy minimization, partition function, base-pair probabilities...) are reformulated within this framework, giving rise to very simple algorithms. This reformulation allows one to conceptually detach the conformation space/energy model -- captured by the hypergraph model -- from the specific application, assuming unambiguity of the decomposition. To ensure the latter property, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3771","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":"1106.3771","created_at":"2026-05-18T04:19:42.218160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.3771v1","created_at":"2026-05-18T04:19:42.218160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3771","created_at":"2026-05-18T04:19:42.218160+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5QSFWACFV3B","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5QSFWACFV3BSCKL","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5QSFWAC","created_at":"2026-05-18T12:26:41.206345+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/T5QSFWACFV3BSCKLAWBDW47JHF","json":"https://pith.science/pith/T5QSFWACFV3BSCKLAWBDW47JHF.json","graph_json":"https://pith.science/api/pith-number/T5QSFWACFV3BSCKLAWBDW47JHF/graph.json","events_json":"https://pith.science/api/pith-number/T5QSFWACFV3BSCKLAWBDW47JHF/events.json","paper":"https://pith.science/paper/T5QSFWAC"},"agent_actions":{"view_html":"https://pith.science/pith/T5QSFWACFV3BSCKLAWBDW47JHF","download_json":"https://pith.science/pith/T5QSFWACFV3BSCKLAWBDW47JHF.json","view_paper":"https://pith.science/paper/T5QSFWAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.3771&json=true","fetch_graph":"https://pith.science/api/pith-number/T5QSFWACFV3BSCKLAWBDW47JHF/graph.json","fetch_events":"https://pith.science/api/pith-number/T5QSFWACFV3BSCKLAWBDW47JHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5QSFWACFV3BSCKLAWBDW47JHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5QSFWACFV3BSCKLAWBDW47JHF/action/storage_attestation","attest_author":"https://pith.science/pith/T5QSFWACFV3BSCKLAWBDW47JHF/action/author_attestation","sign_citation":"https://pith.science/pith/T5QSFWACFV3BSCKLAWBDW47JHF/action/citation_signature","submit_replication":"https://pith.science/pith/T5QSFWACFV3BSCKLAWBDW47JHF/action/replication_record"}},"created_at":"2026-05-18T04:19:42.218160+00:00","updated_at":"2026-05-18T04:19:42.218160+00:00"}