{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6CNBE57PTFH6HDJC3NDRNAP5IA","short_pith_number":"pith:6CNBE57P","canonical_record":{"source":{"id":"1307.7811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2013-07-30T04:42:47Z","cross_cats_sorted":["cs.CE","cs.DS"],"title_canon_sha256":"179d56d127409d49e545abb2642a58a0a76661fa7b362cabf14cb1d6385c2676","abstract_canon_sha256":"b21446ba7d8b0161cde32f33173188da3e1dbce22544e853762566563bff3545"},"schema_version":"1.0"},"canonical_sha256":"f09a1277ef994fe38d22db471681fd401fc0071bbc81c4194c7d5b73d431ea41","source":{"kind":"arxiv","id":"1307.7811","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7811","created_at":"2026-05-18T03:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7811v1","created_at":"2026-05-18T03:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7811","created_at":"2026-05-18T03:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"6CNBE57PTFH6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6CNBE57PTFH6HDJC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6CNBE57P","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6CNBE57PTFH6HDJC3NDRNAP5IA","target":"record","payload":{"canonical_record":{"source":{"id":"1307.7811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2013-07-30T04:42:47Z","cross_cats_sorted":["cs.CE","cs.DS"],"title_canon_sha256":"179d56d127409d49e545abb2642a58a0a76661fa7b362cabf14cb1d6385c2676","abstract_canon_sha256":"b21446ba7d8b0161cde32f33173188da3e1dbce22544e853762566563bff3545"},"schema_version":"1.0"},"canonical_sha256":"f09a1277ef994fe38d22db471681fd401fc0071bbc81c4194c7d5b73d431ea41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:02.495358Z","signature_b64":"MAvk5E/A+hZENkKvUzKsUHzzMV6uFfRiQcBKYm0PTI2O8nvwY0IabH/wdE0Ucx57ngQ6SD5Zs4D5IyhKNzfYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f09a1277ef994fe38d22db471681fd401fc0071bbc81c4194c7d5b73d431ea41","last_reissued_at":"2026-05-18T03:17:02.494297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:02.494297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.7811","source_version":1,"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-18T03:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bVNSgVXb7BlTIIY30JB5zqmSuUJ8yWOvParfDFdn6sD4GrnXWhnQAURIjuUOdsvVM/ZWKuV4EZZxRPcm8gb6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:29:02.613256Z"},"content_sha256":"39e63bbeda3bc1a60ced4fdee82d408e9b30535381fd9f89db5f7ae0d8bfe585","schema_version":"1.0","event_id":"sha256:39e63bbeda3bc1a60ced4fdee82d408e9b30535381fd9f89db5f7ae0d8bfe585"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6CNBE57PTFH6HDJC3NDRNAP5IA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.DS"],"primary_cat":"q-bio.QM","authors_text":"Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli M\\\"akinen","submitted_at":"2013-07-30T04:42:47Z","abstract_excerpt":"RNA-Seq technology offers new high-throughput ways for transcript identification and quantification based on short reads, and has recently attracted great interest. The problem is usually modeled by a weighted splicing graph whose nodes stand for exons and whose edges stand for split alignments to the exons. The task consists of finding a number of paths, together with their expression levels, which optimally explain the coverages of the graph under various fitness functions, such least sum of squares. In (Tomescu et al. RECOMB-seq 2013) we showed that under general fitness functions, if we al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7811","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"},"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-18T03:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqZzCKj/TNNSsIFXYIgV4wN+rVD2pZNPjx903YvgGlqw2PN52atNLNJdSNq6GNsFWig5SQ5E1YOYduw8TLVNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:29:02.613947Z"},"content_sha256":"b41a68590ca3502f5880ba85dcfcf0b44eb537ed3b17eeb1144d025d8e986659","schema_version":"1.0","event_id":"sha256:b41a68590ca3502f5880ba85dcfcf0b44eb537ed3b17eeb1144d025d8e986659"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CNBE57PTFH6HDJC3NDRNAP5IA/bundle.json","state_url":"https://pith.science/pith/6CNBE57PTFH6HDJC3NDRNAP5IA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CNBE57PTFH6HDJC3NDRNAP5IA/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-31T13:29:02Z","links":{"resolver":"https://pith.science/pith/6CNBE57PTFH6HDJC3NDRNAP5IA","bundle":"https://pith.science/pith/6CNBE57PTFH6HDJC3NDRNAP5IA/bundle.json","state":"https://pith.science/pith/6CNBE57PTFH6HDJC3NDRNAP5IA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CNBE57PTFH6HDJC3NDRNAP5IA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6CNBE57PTFH6HDJC3NDRNAP5IA","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":"b21446ba7d8b0161cde32f33173188da3e1dbce22544e853762566563bff3545","cross_cats_sorted":["cs.CE","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2013-07-30T04:42:47Z","title_canon_sha256":"179d56d127409d49e545abb2642a58a0a76661fa7b362cabf14cb1d6385c2676"},"schema_version":"1.0","source":{"id":"1307.7811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7811","created_at":"2026-05-18T03:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7811v1","created_at":"2026-05-18T03:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7811","created_at":"2026-05-18T03:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"6CNBE57PTFH6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6CNBE57PTFH6HDJC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6CNBE57P","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:b41a68590ca3502f5880ba85dcfcf0b44eb537ed3b17eeb1144d025d8e986659","target":"graph","created_at":"2026-05-18T03:17:02Z","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":"RNA-Seq technology offers new high-throughput ways for transcript identification and quantification based on short reads, and has recently attracted great interest. The problem is usually modeled by a weighted splicing graph whose nodes stand for exons and whose edges stand for split alignments to the exons. The task consists of finding a number of paths, together with their expression levels, which optimally explain the coverages of the graph under various fitness functions, such least sum of squares. In (Tomescu et al. RECOMB-seq 2013) we showed that under general fitness functions, if we al","authors_text":"Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli M\\\"akinen","cross_cats":["cs.CE","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2013-07-30T04:42:47Z","title":"A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7811","kind":"arxiv","version":1},"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:39e63bbeda3bc1a60ced4fdee82d408e9b30535381fd9f89db5f7ae0d8bfe585","target":"record","created_at":"2026-05-18T03:17:02Z","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":"b21446ba7d8b0161cde32f33173188da3e1dbce22544e853762566563bff3545","cross_cats_sorted":["cs.CE","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2013-07-30T04:42:47Z","title_canon_sha256":"179d56d127409d49e545abb2642a58a0a76661fa7b362cabf14cb1d6385c2676"},"schema_version":"1.0","source":{"id":"1307.7811","kind":"arxiv","version":1}},"canonical_sha256":"f09a1277ef994fe38d22db471681fd401fc0071bbc81c4194c7d5b73d431ea41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f09a1277ef994fe38d22db471681fd401fc0071bbc81c4194c7d5b73d431ea41","first_computed_at":"2026-05-18T03:17:02.494297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:02.494297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MAvk5E/A+hZENkKvUzKsUHzzMV6uFfRiQcBKYm0PTI2O8nvwY0IabH/wdE0Ucx57ngQ6SD5Zs4D5IyhKNzfYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:02.495358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39e63bbeda3bc1a60ced4fdee82d408e9b30535381fd9f89db5f7ae0d8bfe585","sha256:b41a68590ca3502f5880ba85dcfcf0b44eb537ed3b17eeb1144d025d8e986659"],"state_sha256":"7bf8efc4d8bba2e1c3352c7bfe301ce5c7fe0a7a4e1a8fefa2cb3ac4c4c61480"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OBQ0I657fExGT1F0bB9BRS/Vf8JreciyX5UXzqvJIdv3yBNLkUTO+pu4ultjplwDVXTCSAZ5aHFUsbLr2Xo+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:29:02.618138Z","bundle_sha256":"1441aa00ce23cc93680b4f5a8c9117e9e5fcce231e796ced846c4a16dfb53051"}}