{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GGQQ34FJKU6OWC6FAVVV4ZLDKS","short_pith_number":"pith:GGQQ34FJ","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"},"canonical_sha256":"31a10df0a9553ceb0bc5056b5e656354b273a3af454e9436bb7738f52773e1d5","source":{"kind":"arxiv","id":"1502.03201","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03201","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03201v2","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03201","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"GGQQ34FJKU6O","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GGQQ34FJKU6OWC6F","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GGQQ34FJ","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GGQQ34FJKU6OWC6FAVVV4ZLDKS","target":"record","payload":{"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"},"canonical_sha256":"31a10df0a9553ceb0bc5056b5e656354b273a3af454e9436bb7738f52773e1d5","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"},"source_kind":"arxiv","source_id":"1502.03201","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:42:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n1yOBaUCaVVm5mMVXGCn7ahZEbtoSOm6GVP8Ek/LSj6+f9g8gNyZG9cDKKl5xKV85xEvUvj9MXm1WMUrjtScBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T02:29:23.471732Z"},"content_sha256":"8e2c7ec4ac905a7448294ec1d35807a4ef67054cebfb44ae40421d91d78bf854","schema_version":"1.0","event_id":"sha256:8e2c7ec4ac905a7448294ec1d35807a4ef67054cebfb44ae40421d91d78bf854"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GGQQ34FJKU6OWC6FAVVV4ZLDKS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:42:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gmnKeKucHndgJkT/h8c8itZVSbxYt4n0U8H/+jlrYdZA1kgNESHzGEy14K4eRVzf/TP50vusp2ys6ZXDagA/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T02:29:23.472076Z"},"content_sha256":"cd79efce4ade675c7cdb64dfbdcf9475759c458444b3e879afc7e2267a7ffe59","schema_version":"1.0","event_id":"sha256:cd79efce4ade675c7cdb64dfbdcf9475759c458444b3e879afc7e2267a7ffe59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS/bundle.json","state_url":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T02:29:23Z","links":{"resolver":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS","bundle":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS/bundle.json","state":"https://pith.science/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGQQ34FJKU6OWC6FAVVV4ZLDKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GGQQ34FJKU6OWC6FAVVV4ZLDKS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bf5c5e544132fd4bcf1c8de4c3104627e16adbd85e3a07f1ccb032041e1da7b5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-02-11T06:47:23Z","title_canon_sha256":"14891b541ab1afa2f88d14f195d2fcc3c5ae015f3a9ef0c2defe2c6a5e35d87b"},"schema_version":"1.0","source":{"id":"1502.03201","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03201","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03201v2","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03201","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"GGQQ34FJKU6O","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GGQQ34FJKU6OWC6F","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GGQQ34FJ","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:cd79efce4ade675c7cdb64dfbdcf9475759c458444b3e879afc7e2267a7ffe59","target":"graph","created_at":"2026-05-18T01:42:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"AMIB), J\\'an Ma\\v{n}uch (UBC-Computer Science), Jozef Hale\\v{s}, Ladislav Stacho, Yann Ponty (LIX","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-02-11T06:47:23Z","title":"Combinatorial RNA Design: Designability and Structure-Approximating Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03201","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8e2c7ec4ac905a7448294ec1d35807a4ef67054cebfb44ae40421d91d78bf854","target":"record","created_at":"2026-05-18T01:42:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bf5c5e544132fd4bcf1c8de4c3104627e16adbd85e3a07f1ccb032041e1da7b5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-02-11T06:47:23Z","title_canon_sha256":"14891b541ab1afa2f88d14f195d2fcc3c5ae015f3a9ef0c2defe2c6a5e35d87b"},"schema_version":"1.0","source":{"id":"1502.03201","kind":"arxiv","version":2}},"canonical_sha256":"31a10df0a9553ceb0bc5056b5e656354b273a3af454e9436bb7738f52773e1d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31a10df0a9553ceb0bc5056b5e656354b273a3af454e9436bb7738f52773e1d5","first_computed_at":"2026-05-18T01:42:47.743064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:47.743064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1wEnPhe7z/0Ta46fHH6cDUKmm+yd48aCV3Ce6qolVsJAEOHlHG1TIPuKlJsC/c9EqRy+HV+vzKUGiZa9d3lWCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:47.743819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03201","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e2c7ec4ac905a7448294ec1d35807a4ef67054cebfb44ae40421d91d78bf854","sha256:cd79efce4ade675c7cdb64dfbdcf9475759c458444b3e879afc7e2267a7ffe59"],"state_sha256":"689012184fd045cabcc70a3de9ef405eb98139092a15af4c381206ae77755436"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phv1gdjFqMQWPj/1s0Z7x+IQ7J9adjEISxqA99gv5Alq2d7JBCnE+vCOjKnBe5LhVInPBWAymwpFdlzJkdLhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T02:29:23.473956Z","bundle_sha256":"9dcfc166ebfa0fc059ad9e17d42b6630caaad95a4f06e458a2a510b256228643"}}