{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HCOWBKYVQ7SGFW5X5IEXWBHC5P","short_pith_number":"pith:HCOWBKYV","schema_version":"1.0","canonical_sha256":"389d60ab1587e462dbb7ea097b04e2ebd6f4245b5e5aac66a7ea08dbec186a20","source":{"kind":"arxiv","id":"2501.14662","version":5},"attestation_state":"computed","paper":{"title":"Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Mathieu Besan\\c{c}on","submitted_at":"2025-01-24T17:35:07Z","abstract_excerpt":"Decomposing a flow on a Directed Acyclic Graph (DAG) into a weighted sum of a small number of paths is an essential task in operations research and bioinformatics. This problem, referred to as Sparse Flow Decomposition (SFD), has gained significant interest, in particular for its application in RNA transcript multi-assembly, the identification of the multiple transcripts corresponding to a given gene and their relative abundance. Several recent approaches cast SFD variants as integer optimization problems, motivated by the NP-hardness of the formulations they consider. We propose an alternativ"},"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":"2501.14662","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-24T17:35:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2247839bb777ad6149d08e841d1af8b70f4686684b709eacb593e8ac049a8f24","abstract_canon_sha256":"7c213be91cb5675b1077c3fd67d832597913bfa609b28f124018e2c278b8ad7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:32.423594Z","signature_b64":"ohmYU3sRczkvs+DlEmNVOOlFpXB52Q5VdLoRNUZTE/9+5kef+LyRcD8lx0GOgMkorteDymM6uU8Rbd3BwpOQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"389d60ab1587e462dbb7ea097b04e2ebd6f4245b5e5aac66a7ea08dbec186a20","last_reissued_at":"2026-07-05T11:40:32.423118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:32.423118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Mathieu Besan\\c{c}on","submitted_at":"2025-01-24T17:35:07Z","abstract_excerpt":"Decomposing a flow on a Directed Acyclic Graph (DAG) into a weighted sum of a small number of paths is an essential task in operations research and bioinformatics. This problem, referred to as Sparse Flow Decomposition (SFD), has gained significant interest, in particular for its application in RNA transcript multi-assembly, the identification of the multiple transcripts corresponding to a given gene and their relative abundance. Several recent approaches cast SFD variants as integer optimization problems, motivated by the NP-hardness of the formulations they consider. We propose an alternativ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14662","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.14662/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.14662","created_at":"2026-07-05T11:40:32.423168+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.14662v5","created_at":"2026-07-05T11:40:32.423168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14662","created_at":"2026-07-05T11:40:32.423168+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCOWBKYVQ7SG","created_at":"2026-07-05T11:40:32.423168+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCOWBKYVQ7SGFW5X","created_at":"2026-07-05T11:40:32.423168+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCOWBKYV","created_at":"2026-07-05T11:40:32.423168+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/HCOWBKYVQ7SGFW5X5IEXWBHC5P","json":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P.json","graph_json":"https://pith.science/api/pith-number/HCOWBKYVQ7SGFW5X5IEXWBHC5P/graph.json","events_json":"https://pith.science/api/pith-number/HCOWBKYVQ7SGFW5X5IEXWBHC5P/events.json","paper":"https://pith.science/paper/HCOWBKYV"},"agent_actions":{"view_html":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P","download_json":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P.json","view_paper":"https://pith.science/paper/HCOWBKYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.14662&json=true","fetch_graph":"https://pith.science/api/pith-number/HCOWBKYVQ7SGFW5X5IEXWBHC5P/graph.json","fetch_events":"https://pith.science/api/pith-number/HCOWBKYVQ7SGFW5X5IEXWBHC5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P/action/storage_attestation","attest_author":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P/action/author_attestation","sign_citation":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P/action/citation_signature","submit_replication":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P/action/replication_record"}},"created_at":"2026-07-05T11:40:32.423168+00:00","updated_at":"2026-07-05T11:40:32.423168+00:00"}