{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RWEYJL7ISNKQX5G6MYKJIZT2ES","short_pith_number":"pith:RWEYJL7I","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"},"canonical_sha256":"8d8984afe893550bf4de661494667a2493465830ff671f6f0f234a2c05f1c32c","source":{"kind":"arxiv","id":"1511.04731","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04731","created_at":"2026-05-18T00:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04731v3","created_at":"2026-05-18T00:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04731","created_at":"2026-05-18T00:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"RWEYJL7ISNKQ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RWEYJL7ISNKQX5G6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RWEYJL7I","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RWEYJL7ISNKQX5G6MYKJIZT2ES","target":"record","payload":{"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"},"canonical_sha256":"8d8984afe893550bf4de661494667a2493465830ff671f6f0f234a2c05f1c32c","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"},"source_kind":"arxiv","source_id":"1511.04731","source_version":3,"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-18T00:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GSPrAvM9PaXgogfImPEw9qCdl8kvplTu2RCA7VYUcvCKt+EILq+TbYDrfrIdd4bPPqUjthsrqzRb7RopwgF7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:58:16.726755Z"},"content_sha256":"67adea8e26116708c6cd5b4f7f5670dc7a40e0770c3d833c53da9a213f5ae8b5","schema_version":"1.0","event_id":"sha256:67adea8e26116708c6cd5b4f7f5670dc7a40e0770c3d833c53da9a213f5ae8b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RWEYJL7ISNKQX5G6MYKJIZT2ES","target":"graph","payload":{"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"},"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-18T00:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aKaushshJNEwIICp5arGqOqQEk7au8p+FP2kLzQHz6qgmzcSkEVp26/15t0KJd8wuomu+kXd8rpbCwiaAimpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:58:16.727422Z"},"content_sha256":"a2a6d9616056baa594dabbbff791bfb8147979393ee504d29cf5c068948a4042","schema_version":"1.0","event_id":"sha256:a2a6d9616056baa594dabbbff791bfb8147979393ee504d29cf5c068948a4042"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES/bundle.json","state_url":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES/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-05-27T00:58:16Z","links":{"resolver":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES","bundle":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES/bundle.json","state":"https://pith.science/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RWEYJL7ISNKQX5G6MYKJIZT2ES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RWEYJL7ISNKQX5G6MYKJIZT2ES","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":"2dda7dca47f6160aa4677cd8454774d3569732b6c27d156086851b51c005085f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-15T17:09:26Z","title_canon_sha256":"0fb3e1e54916f769fea8ad6c8207be7d9bd58544be6acd2bb684765e375ec850"},"schema_version":"1.0","source":{"id":"1511.04731","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04731","created_at":"2026-05-18T00:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04731v3","created_at":"2026-05-18T00:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04731","created_at":"2026-05-18T00:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"RWEYJL7ISNKQ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RWEYJL7ISNKQX5G6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RWEYJL7I","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:a2a6d9616056baa594dabbbff791bfb8147979393ee504d29cf5c068948a4042","target":"graph","created_at":"2026-05-18T00:20:27Z","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":"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","authors_text":"Yi-Jun Chang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-15T17:09:26Z","title":"Hardness of RNA Folding Problem with Four Symbols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04731","kind":"arxiv","version":3},"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:67adea8e26116708c6cd5b4f7f5670dc7a40e0770c3d833c53da9a213f5ae8b5","target":"record","created_at":"2026-05-18T00:20:27Z","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":"2dda7dca47f6160aa4677cd8454774d3569732b6c27d156086851b51c005085f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-15T17:09:26Z","title_canon_sha256":"0fb3e1e54916f769fea8ad6c8207be7d9bd58544be6acd2bb684765e375ec850"},"schema_version":"1.0","source":{"id":"1511.04731","kind":"arxiv","version":3}},"canonical_sha256":"8d8984afe893550bf4de661494667a2493465830ff671f6f0f234a2c05f1c32c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d8984afe893550bf4de661494667a2493465830ff671f6f0f234a2c05f1c32c","first_computed_at":"2026-05-18T00:20:27.816756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:27.816756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BCaAqpsg3jZvvk6ILQoxxIJ1EoZKJyc2uTSt0SROiaeWxIdRYP/9nN1W4lPPeS0wmfUJie+Ilvoe/OfHDvx7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:27.817272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04731","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67adea8e26116708c6cd5b4f7f5670dc7a40e0770c3d833c53da9a213f5ae8b5","sha256:a2a6d9616056baa594dabbbff791bfb8147979393ee504d29cf5c068948a4042"],"state_sha256":"68db88eb7dd9bb6539d2fe634abb9537e7bfa84a5573fa449cc60ffbf2d702da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7o6Qxk+eZUve6bU2tg5WFIoXvcyjlSRq3qfQenk89ikTH9QCQd+N3pBi0mKqQlurxCruDM82Ot2ZTLeSi81qDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:58:16.730995Z","bundle_sha256":"32369a6053419140f07fba17bd5ec20c5076c95deee3b9415968d40635ec52ea"}}