{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FNYQIPU6JHFCFO62VXBHMLDTNZ","short_pith_number":"pith:FNYQIPU6","canonical_record":{"source":{"id":"1201.0308","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-31T21:11:53Z","cross_cats_sorted":[],"title_canon_sha256":"308a26a60ce5a4cc6c47786ebcfe2e92f13040d8c451bf7b762c1bbdf93e073a","abstract_canon_sha256":"60fe5b888eae26a4ecc4e3d28b9dd16b35833c10b551d4f200db8aed16d6df0d"},"schema_version":"1.0"},"canonical_sha256":"2b71043e9e49ca22bbdaadc2762c736e4443f624e315793ff0dfbce44625379f","source":{"kind":"arxiv","id":"1201.0308","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0308","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0308v2","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0308","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"FNYQIPU6JHFC","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FNYQIPU6JHFCFO62","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FNYQIPU6","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FNYQIPU6JHFCFO62VXBHMLDTNZ","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0308","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-31T21:11:53Z","cross_cats_sorted":[],"title_canon_sha256":"308a26a60ce5a4cc6c47786ebcfe2e92f13040d8c451bf7b762c1bbdf93e073a","abstract_canon_sha256":"60fe5b888eae26a4ecc4e3d28b9dd16b35833c10b551d4f200db8aed16d6df0d"},"schema_version":"1.0"},"canonical_sha256":"2b71043e9e49ca22bbdaadc2762c736e4443f624e315793ff0dfbce44625379f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:06.326662Z","signature_b64":"35FGghs4+Dt4CPb5Ndq3hkcKyL6Uy1GKPB0XVhy1XMYJlDhppjR++qkDwXKo166VyZP1QNoOJIl3BxWRI3BSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b71043e9e49ca22bbdaadc2762c736e4443f624e315793ff0dfbce44625379f","last_reissued_at":"2026-05-18T04:03:06.325848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:06.325848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0308","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-18T04:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"drUL0ZjdvWvWNoSbPS7vhyLc5YnSDGnKjGvhyTdfnRu2UZHzCCfo9qdJAj73l5ahuaFwOdOSoHIGqVQPVDvCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:39:56.067154Z"},"content_sha256":"c207c712d494e4df4efce8ed355bc61c32db760a5df1bb50b744d5d5ef8722d3","schema_version":"1.0","event_id":"sha256:c207c712d494e4df4efce8ed355bc61c32db760a5df1bb50b744d5d5ef8722d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FNYQIPU6JHFCFO62VXBHMLDTNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the combinatorics of sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian M. Reidys, Fenix W. D. Huang","submitted_at":"2011-12-31T21:11:53Z","abstract_excerpt":"Background: We study the sparsification of dynamic programming folding algorithms of RNA structures. Sparsification applies to the mfe-folding of RNA structures and can lead to a significant reduction of time complexity. Results: We analyze the sparsification of a particular decomposition rule, $\\Lambda^*$, that splits an interval for RNA secondary and pseudoknot structures of fixed topological genus. Essential for quantifying the sparsification is the size of its so called candidate set. We present a combinatorial framework which allows by means of probabilities of irreducible substructures t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0308","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-18T04:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6mFnJvuVbrBcEBxeBIx9MofVN+STG8JNOrjJ4sPMHS7hPlhsBoZ6gYT/YiqGZzJ+LMffxBOSazXpN3WaJExBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:39:56.067823Z"},"content_sha256":"a0ee4e481dde20f194f583d111c82b9964f530db93088511f0729bfef97a65df","schema_version":"1.0","event_id":"sha256:a0ee4e481dde20f194f583d111c82b9964f530db93088511f0729bfef97a65df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNYQIPU6JHFCFO62VXBHMLDTNZ/bundle.json","state_url":"https://pith.science/pith/FNYQIPU6JHFCFO62VXBHMLDTNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNYQIPU6JHFCFO62VXBHMLDTNZ/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-05T19:39:56Z","links":{"resolver":"https://pith.science/pith/FNYQIPU6JHFCFO62VXBHMLDTNZ","bundle":"https://pith.science/pith/FNYQIPU6JHFCFO62VXBHMLDTNZ/bundle.json","state":"https://pith.science/pith/FNYQIPU6JHFCFO62VXBHMLDTNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNYQIPU6JHFCFO62VXBHMLDTNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FNYQIPU6JHFCFO62VXBHMLDTNZ","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":"60fe5b888eae26a4ecc4e3d28b9dd16b35833c10b551d4f200db8aed16d6df0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-31T21:11:53Z","title_canon_sha256":"308a26a60ce5a4cc6c47786ebcfe2e92f13040d8c451bf7b762c1bbdf93e073a"},"schema_version":"1.0","source":{"id":"1201.0308","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0308","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0308v2","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0308","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"FNYQIPU6JHFC","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FNYQIPU6JHFCFO62","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FNYQIPU6","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:a0ee4e481dde20f194f583d111c82b9964f530db93088511f0729bfef97a65df","target":"graph","created_at":"2026-05-18T04:03:06Z","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":"Background: We study the sparsification of dynamic programming folding algorithms of RNA structures. Sparsification applies to the mfe-folding of RNA structures and can lead to a significant reduction of time complexity. Results: We analyze the sparsification of a particular decomposition rule, $\\Lambda^*$, that splits an interval for RNA secondary and pseudoknot structures of fixed topological genus. Essential for quantifying the sparsification is the size of its so called candidate set. We present a combinatorial framework which allows by means of probabilities of irreducible substructures t","authors_text":"Christian M. Reidys, Fenix W. D. Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-31T21:11:53Z","title":"On the combinatorics of sparsification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0308","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:c207c712d494e4df4efce8ed355bc61c32db760a5df1bb50b744d5d5ef8722d3","target":"record","created_at":"2026-05-18T04:03:06Z","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":"60fe5b888eae26a4ecc4e3d28b9dd16b35833c10b551d4f200db8aed16d6df0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-31T21:11:53Z","title_canon_sha256":"308a26a60ce5a4cc6c47786ebcfe2e92f13040d8c451bf7b762c1bbdf93e073a"},"schema_version":"1.0","source":{"id":"1201.0308","kind":"arxiv","version":2}},"canonical_sha256":"2b71043e9e49ca22bbdaadc2762c736e4443f624e315793ff0dfbce44625379f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b71043e9e49ca22bbdaadc2762c736e4443f624e315793ff0dfbce44625379f","first_computed_at":"2026-05-18T04:03:06.325848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:06.325848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"35FGghs4+Dt4CPb5Ndq3hkcKyL6Uy1GKPB0XVhy1XMYJlDhppjR++qkDwXKo166VyZP1QNoOJIl3BxWRI3BSBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:06.326662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0308","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c207c712d494e4df4efce8ed355bc61c32db760a5df1bb50b744d5d5ef8722d3","sha256:a0ee4e481dde20f194f583d111c82b9964f530db93088511f0729bfef97a65df"],"state_sha256":"b62a095883dd5483f23a1cc79e4530db02b97d3d74caa20dd7dcad1f33e705ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJby8i2FwYqJMES2F5Tl90KxyIRyqPYbigC1QaUmOQ0dAPet4fCaJ4ovWLhG9+PJ0/G6PnGYIgyZezn32CN0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:39:56.071927Z","bundle_sha256":"712b0523ac780309bc5f6f7fe0fa5ad949802e09f6ba386a416447c13b58b45d"}}