{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:ANORZQKJ5OEPJIZRZKTRDZ7QIJ","short_pith_number":"pith:ANORZQKJ","schema_version":"1.0","canonical_sha256":"035d1cc149eb88f4a331caa711e7f04277f4f82225490f66aee524f8fb581533","source":{"kind":"arxiv","id":"physics/0609135","version":1},"attestation_state":"computed","paper":{"title":"RNA secondary structure design","license":"","headline":"","cross_cats":["q-bio.BM"],"primary_cat":"physics.bio-ph","authors_text":"Alexander K. Hartmann, Bernd Burghardt","submitted_at":"2006-09-15T13:01:37Z","abstract_excerpt":"We consider the inverse-folding problem for RNA secondary structures: for a given (pseudo-knot-free) secondary structure find a sequence that has that structure as its ground state. If such a sequence exists, the structure is called designable. We implemented a branch-and-bound algorithm that is able to do an exhaustive search within the sequence space, i.e., gives an exact answer whether such a sequence exists. The bound required by the branch-and-bound algorithm are calculated by a dynamic programming algorithm. We consider different alphabet sizes and an ensemble of random structures, which"},"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":"physics/0609135","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"physics.bio-ph","submitted_at":"2006-09-15T13:01:37Z","cross_cats_sorted":["q-bio.BM"],"title_canon_sha256":"9fdad82e5092aaf746633978e1638d360aea1265d4afc70f5400ae1f6a3fb2cc","abstract_canon_sha256":"ef551bf1e698aea0ecaa91f284314754cb34f25c24354ee1c2afeefd489571f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:38:06.612943Z","signature_b64":"5aU/ztm24ck0oq/QvxJJOC3vm/d5w0gz19pCKJmC6M/jOs68oQHzvWGfsWMUH+xqOlijte7+tpMnkqftRqL+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"035d1cc149eb88f4a331caa711e7f04277f4f82225490f66aee524f8fb581533","last_reissued_at":"2026-05-18T01:38:06.612527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:38:06.612527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RNA secondary structure design","license":"","headline":"","cross_cats":["q-bio.BM"],"primary_cat":"physics.bio-ph","authors_text":"Alexander K. Hartmann, Bernd Burghardt","submitted_at":"2006-09-15T13:01:37Z","abstract_excerpt":"We consider the inverse-folding problem for RNA secondary structures: for a given (pseudo-knot-free) secondary structure find a sequence that has that structure as its ground state. If such a sequence exists, the structure is called designable. We implemented a branch-and-bound algorithm that is able to do an exhaustive search within the sequence space, i.e., gives an exact answer whether such a sequence exists. The bound required by the branch-and-bound algorithm are calculated by a dynamic programming algorithm. We consider different alphabet sizes and an ensemble of random structures, which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"physics/0609135","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":"physics/0609135","created_at":"2026-05-18T01:38:06.612590+00:00"},{"alias_kind":"arxiv_version","alias_value":"physics/0609135v1","created_at":"2026-05-18T01:38:06.612590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.physics/0609135","created_at":"2026-05-18T01:38:06.612590+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANORZQKJ5OEP","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANORZQKJ5OEPJIZR","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANORZQKJ","created_at":"2026-05-18T12:25:53.939244+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/ANORZQKJ5OEPJIZRZKTRDZ7QIJ","json":"https://pith.science/pith/ANORZQKJ5OEPJIZRZKTRDZ7QIJ.json","graph_json":"https://pith.science/api/pith-number/ANORZQKJ5OEPJIZRZKTRDZ7QIJ/graph.json","events_json":"https://pith.science/api/pith-number/ANORZQKJ5OEPJIZRZKTRDZ7QIJ/events.json","paper":"https://pith.science/paper/ANORZQKJ"},"agent_actions":{"view_html":"https://pith.science/pith/ANORZQKJ5OEPJIZRZKTRDZ7QIJ","download_json":"https://pith.science/pith/ANORZQKJ5OEPJIZRZKTRDZ7QIJ.json","view_paper":"https://pith.science/paper/ANORZQKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=physics/0609135&json=true","fetch_graph":"https://pith.science/api/pith-number/ANORZQKJ5OEPJIZRZKTRDZ7QIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ANORZQKJ5OEPJIZRZKTRDZ7QIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANORZQKJ5OEPJIZRZKTRDZ7QIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANORZQKJ5OEPJIZRZKTRDZ7QIJ/action/storage_attestation","attest_author":"https://pith.science/pith/ANORZQKJ5OEPJIZRZKTRDZ7QIJ/action/author_attestation","sign_citation":"https://pith.science/pith/ANORZQKJ5OEPJIZRZKTRDZ7QIJ/action/citation_signature","submit_replication":"https://pith.science/pith/ANORZQKJ5OEPJIZRZKTRDZ7QIJ/action/replication_record"}},"created_at":"2026-05-18T01:38:06.612590+00:00","updated_at":"2026-05-18T01:38:06.612590+00:00"}