{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GGQQ34FJKU6OWC6FAVVV4ZLDKS","short_pith_number":"pith:GGQQ34FJ","schema_version":"1.0","canonical_sha256":"31a10df0a9553ceb0bc5056b5e656354b273a3af454e9436bb7738f52773e1d5","source":{"kind":"arxiv","id":"1502.03201","version":2},"attestation_state":"computed","paper":{"title":"Combinatorial RNA Design: Designability and Structure-Approximating Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.QM","authors_text":"AMIB), J\\'an Ma\\v{n}uch (UBC-Computer Science), Jozef Hale\\v{s}, Ladislav Stacho, Yann Ponty (LIX","submitted_at":"2015-02-11T06:47:23Z","abstract_excerpt":"In this work, we consider the Combinatorial RNA Design problem, a minimal instance of the RNA design problem which aims at finding a sequence that admits a given target as its unique base pair maximizing structure. We provide complete characterizations for the structures that can be designed using restricted alphabets. Under a classic four-letter alphabet, we provide a complete characterization of designable structures without unpaired bases. When unpaired bases are allowed, we provide partial characterizations for classes of designable/undesignable structures, and show that the class of desig"},"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":"1502.03201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-02-11T06:47:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"14891b541ab1afa2f88d14f195d2fcc3c5ae015f3a9ef0c2defe2c6a5e35d87b","abstract_canon_sha256":"bf5c5e544132fd4bcf1c8de4c3104627e16adbd85e3a07f1ccb032041e1da7b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:47.743819Z","signature_b64":"1wEnPhe7z/0Ta46fHH6cDUKmm+yd48aCV3Ce6qolVsJAEOHlHG1TIPuKlJsC/c9EqRy+HV+vzKUGiZa9d3lWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31a10df0a9553ceb0bc5056b5e656354b273a3af454e9436bb7738f52773e1d5","last_reissued_at":"2026-05-18T01:42:47.743064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:47.743064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial RNA Design: Designability and Structure-Approximating Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.QM","authors_text":"AMIB), J\\'an Ma\\v{n}uch (UBC-Computer Science), Jozef Hale\\v{s}, Ladislav Stacho, Yann Ponty (LIX","submitted_at":"2015-02-11T06:47:23Z","abstract_excerpt":"In this work, we consider the Combinatorial RNA Design problem, a minimal instance of the RNA design problem which aims at finding a sequence that admits a given target as its unique base pair maximizing structure. We provide complete characterizations for the structures that can be designed using restricted alphabets. Under a classic four-letter alphabet, we provide a complete characterization of designable structures without unpaired bases. When unpaired bases are allowed, we provide partial characterizations for classes of designable/undesignable structures, and show that the class of desig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03201","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":"1502.03201","created_at":"2026-05-18T01:42:47.743180+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03201v2","created_at":"2026-05-18T01:42:47.743180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03201","created_at":"2026-05-18T01:42:47.743180+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGQQ34FJKU6O","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGQQ34FJKU6OWC6F","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGQQ34FJ","created_at":"2026-05-18T12:29:22.688609+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/GGQQ34FJKU6OWC6FAVVV4ZLDKS","json":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS.json","graph_json":"https://pith.science/api/pith-number/GGQQ34FJKU6OWC6FAVVV4ZLDKS/graph.json","events_json":"https://pith.science/api/pith-number/GGQQ34FJKU6OWC6FAVVV4ZLDKS/events.json","paper":"https://pith.science/paper/GGQQ34FJ"},"agent_actions":{"view_html":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS","download_json":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS.json","view_paper":"https://pith.science/paper/GGQQ34FJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03201&json=true","fetch_graph":"https://pith.science/api/pith-number/GGQQ34FJKU6OWC6FAVVV4ZLDKS/graph.json","fetch_events":"https://pith.science/api/pith-number/GGQQ34FJKU6OWC6FAVVV4ZLDKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS/action/storage_attestation","attest_author":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS/action/author_attestation","sign_citation":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS/action/citation_signature","submit_replication":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS/action/replication_record"}},"created_at":"2026-05-18T01:42:47.743180+00:00","updated_at":"2026-05-18T01:42:47.743180+00:00"}