{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5NGEPXX4DHOSZUUDR6WIL3JWNZ","short_pith_number":"pith:5NGEPXX4","schema_version":"1.0","canonical_sha256":"eb4c47defc19dd2cd2838fac85ed366e49403f2d7c500d840b73686fc8a99647","source":{"kind":"arxiv","id":"1706.07851","version":3},"attestation_state":"computed","paper":{"title":"A practical fpt algorithm for Flow Decomposition and transcript assembly","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Andrew van der Poel, Blair D. Sullivan, Felix Reidl, Fernando S\\'anchez Villaamil, Kyle Kloster, Michael P. O'Brien, Philipp Kuinke","submitted_at":"2017-06-23T19:48:03Z","abstract_excerpt":"The Flow Decomposition problem, which asks for the smallest set of weighted paths that \"covers\" a flow on a DAG, has recently been used as an important computational step in transcript assembly. We prove the problem is in FPT when parameterized by the number of paths by giving a practical linear fpt algorithm. Further, we implement and engineer a Flow Decomposition solver based on this algorithm, and evaluate its performance on RNA-sequence data. Crucially, our solver finds exact solutions while achieving runtimes competitive with a state-of-the-art heuristic. Finally, we contextualize our des"},"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":"1706.07851","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-06-23T19:48:03Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"f6cd217400377b836903a775edf6fb83f78ac3c37f6d9d7d4b4de8bb1a5e1125","abstract_canon_sha256":"efe81bb249d7f879ca78221c8415b7855ba4f44dae10f2457536f44e8f9874d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:24.011648Z","signature_b64":"KMjK/yOviLG8PXpw+595oDKPQabOCtkb+1HpF6Ntt1lMYgojo7dIdxwB6HeAjLv5bj4jPwhmbFj2oji1V+byDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb4c47defc19dd2cd2838fac85ed366e49403f2d7c500d840b73686fc8a99647","last_reissued_at":"2026-05-18T00:36:24.010994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:24.010994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A practical fpt algorithm for Flow Decomposition and transcript assembly","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Andrew van der Poel, Blair D. Sullivan, Felix Reidl, Fernando S\\'anchez Villaamil, Kyle Kloster, Michael P. O'Brien, Philipp Kuinke","submitted_at":"2017-06-23T19:48:03Z","abstract_excerpt":"The Flow Decomposition problem, which asks for the smallest set of weighted paths that \"covers\" a flow on a DAG, has recently been used as an important computational step in transcript assembly. We prove the problem is in FPT when parameterized by the number of paths by giving a practical linear fpt algorithm. Further, we implement and engineer a Flow Decomposition solver based on this algorithm, and evaluate its performance on RNA-sequence data. Crucially, our solver finds exact solutions while achieving runtimes competitive with a state-of-the-art heuristic. Finally, we contextualize our des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07851","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":"1706.07851","created_at":"2026-05-18T00:36:24.011083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07851v3","created_at":"2026-05-18T00:36:24.011083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07851","created_at":"2026-05-18T00:36:24.011083+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NGEPXX4DHOS","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NGEPXX4DHOSZUUD","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NGEPXX4","created_at":"2026-05-18T12:31:00.734936+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/5NGEPXX4DHOSZUUDR6WIL3JWNZ","json":"https://pith.science/pith/5NGEPXX4DHOSZUUDR6WIL3JWNZ.json","graph_json":"https://pith.science/api/pith-number/5NGEPXX4DHOSZUUDR6WIL3JWNZ/graph.json","events_json":"https://pith.science/api/pith-number/5NGEPXX4DHOSZUUDR6WIL3JWNZ/events.json","paper":"https://pith.science/paper/5NGEPXX4"},"agent_actions":{"view_html":"https://pith.science/pith/5NGEPXX4DHOSZUUDR6WIL3JWNZ","download_json":"https://pith.science/pith/5NGEPXX4DHOSZUUDR6WIL3JWNZ.json","view_paper":"https://pith.science/paper/5NGEPXX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07851&json=true","fetch_graph":"https://pith.science/api/pith-number/5NGEPXX4DHOSZUUDR6WIL3JWNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5NGEPXX4DHOSZUUDR6WIL3JWNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NGEPXX4DHOSZUUDR6WIL3JWNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NGEPXX4DHOSZUUDR6WIL3JWNZ/action/storage_attestation","attest_author":"https://pith.science/pith/5NGEPXX4DHOSZUUDR6WIL3JWNZ/action/author_attestation","sign_citation":"https://pith.science/pith/5NGEPXX4DHOSZUUDR6WIL3JWNZ/action/citation_signature","submit_replication":"https://pith.science/pith/5NGEPXX4DHOSZUUDR6WIL3JWNZ/action/replication_record"}},"created_at":"2026-05-18T00:36:24.011083+00:00","updated_at":"2026-05-18T00:36:24.011083+00:00"}