{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RWEYJL7ISNKQX5G6MYKJIZT2ES","short_pith_number":"pith:RWEYJL7I","schema_version":"1.0","canonical_sha256":"8d8984afe893550bf4de661494667a2493465830ff671f6f0f234a2c05f1c32c","source":{"kind":"arxiv","id":"1511.04731","version":3},"attestation_state":"computed","paper":{"title":"Hardness of RNA Folding Problem with Four Symbols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Yi-Jun Chang","submitted_at":"2015-11-15T17:09:26Z","abstract_excerpt":"An RNA sequence is a string composed of four types of nucleotides, $A, C, G$, and $U$. The goal of the RNA folding problem is to find a maximum cardinality set of crossing-free pairs of the form $\\{A,U\\}$ or $\\{C,G\\}$ in a given RNA sequence. The problem is central in bioinformatics and has received much attention over the years. Abboud, Backurs, and Williams (FOCS 2015) demonstrated a conditional lower bound for a generalized version of the RNA folding problem based on a conjectured hardness of the $k$-clique problem. Their lower bound requires the RNA sequence to have at least 36 types of sy"},"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":"1511.04731","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-15T17:09:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0fb3e1e54916f769fea8ad6c8207be7d9bd58544be6acd2bb684765e375ec850","abstract_canon_sha256":"2dda7dca47f6160aa4677cd8454774d3569732b6c27d156086851b51c005085f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:27.817272Z","signature_b64":"BCaAqpsg3jZvvk6ILQoxxIJ1EoZKJyc2uTSt0SROiaeWxIdRYP/9nN1W4lPPeS0wmfUJie+Ilvoe/OfHDvx7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d8984afe893550bf4de661494667a2493465830ff671f6f0f234a2c05f1c32c","last_reissued_at":"2026-05-18T00:20:27.816756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:27.816756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of RNA Folding Problem with Four Symbols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Yi-Jun Chang","submitted_at":"2015-11-15T17:09:26Z","abstract_excerpt":"An RNA sequence is a string composed of four types of nucleotides, $A, C, G$, and $U$. The goal of the RNA folding problem is to find a maximum cardinality set of crossing-free pairs of the form $\\{A,U\\}$ or $\\{C,G\\}$ in a given RNA sequence. The problem is central in bioinformatics and has received much attention over the years. Abboud, Backurs, and Williams (FOCS 2015) demonstrated a conditional lower bound for a generalized version of the RNA folding problem based on a conjectured hardness of the $k$-clique problem. Their lower bound requires the RNA sequence to have at least 36 types of sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04731","kind":"arxiv","version":3},"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":"1511.04731","created_at":"2026-05-18T00:20:27.816821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04731v3","created_at":"2026-05-18T00:20:27.816821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04731","created_at":"2026-05-18T00:20:27.816821+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWEYJL7ISNKQ","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWEYJL7ISNKQX5G6","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWEYJL7I","created_at":"2026-05-18T12:29:39.896362+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/RWEYJL7ISNKQX5G6MYKJIZT2ES","json":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES.json","graph_json":"https://pith.science/api/pith-number/RWEYJL7ISNKQX5G6MYKJIZT2ES/graph.json","events_json":"https://pith.science/api/pith-number/RWEYJL7ISNKQX5G6MYKJIZT2ES/events.json","paper":"https://pith.science/paper/RWEYJL7I"},"agent_actions":{"view_html":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES","download_json":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES.json","view_paper":"https://pith.science/paper/RWEYJL7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04731&json=true","fetch_graph":"https://pith.science/api/pith-number/RWEYJL7ISNKQX5G6MYKJIZT2ES/graph.json","fetch_events":"https://pith.science/api/pith-number/RWEYJL7ISNKQX5G6MYKJIZT2ES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES/action/storage_attestation","attest_author":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES/action/author_attestation","sign_citation":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES/action/citation_signature","submit_replication":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES/action/replication_record"}},"created_at":"2026-05-18T00:20:27.816821+00:00","updated_at":"2026-05-18T00:20:27.816821+00:00"}