{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HCOWBKYVQ7SGFW5X5IEXWBHC5P","short_pith_number":"pith:HCOWBKYV","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"},"canonical_sha256":"389d60ab1587e462dbb7ea097b04e2ebd6f4245b5e5aac66a7ea08dbec186a20","source":{"kind":"arxiv","id":"2501.14662","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.14662","created_at":"2026-07-05T11:40:32Z"},{"alias_kind":"arxiv_version","alias_value":"2501.14662v5","created_at":"2026-07-05T11:40:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14662","created_at":"2026-07-05T11:40:32Z"},{"alias_kind":"pith_short_12","alias_value":"HCOWBKYVQ7SG","created_at":"2026-07-05T11:40:32Z"},{"alias_kind":"pith_short_16","alias_value":"HCOWBKYVQ7SGFW5X","created_at":"2026-07-05T11:40:32Z"},{"alias_kind":"pith_short_8","alias_value":"HCOWBKYV","created_at":"2026-07-05T11:40:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HCOWBKYVQ7SGFW5X5IEXWBHC5P","target":"record","payload":{"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"},"canonical_sha256":"389d60ab1587e462dbb7ea097b04e2ebd6f4245b5e5aac66a7ea08dbec186a20","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"},"source_kind":"arxiv","source_id":"2501.14662","source_version":5,"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-07-05T11:40:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+8b+QcxyT2LBOi8SVdK0YWOoAYZylPETpzkgdTUTXIz//P7F4uarWCCMpB2sWKPWMdRdFZ1mb0dKgsbPST7SAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T06:13:53.610908Z"},"content_sha256":"e3fab3bdd8f6bb6df813c2f768865285cdd7d819680c4ee3645a2a5b3622d560","schema_version":"1.0","event_id":"sha256:e3fab3bdd8f6bb6df813c2f768865285cdd7d819680c4ee3645a2a5b3622d560"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HCOWBKYVQ7SGFW5X5IEXWBHC5P","target":"graph","payload":{"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"},"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-07-05T11:40:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VgU3jp1qsPdtL2higokExQr2J3hMLUiK1xZrrB4m9G/U1P4uJHJTBBCEPCiA2EJVfAxU+QEuPy6YpB8cpCrsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T06:13:53.611732Z"},"content_sha256":"44df221084001713c8d534cd74cd48389410b2b680c87f9614f7529f2a04c21c","schema_version":"1.0","event_id":"sha256:44df221084001713c8d534cd74cd48389410b2b680c87f9614f7529f2a04c21c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P/bundle.json","state_url":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P/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-08-11T06:13:53Z","links":{"resolver":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P","bundle":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P/bundle.json","state":"https://pith.science/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCOWBKYVQ7SGFW5X5IEXWBHC5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HCOWBKYVQ7SGFW5X5IEXWBHC5P","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":"7c213be91cb5675b1077c3fd67d832597913bfa609b28f124018e2c278b8ad7b","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-24T17:35:07Z","title_canon_sha256":"2247839bb777ad6149d08e841d1af8b70f4686684b709eacb593e8ac049a8f24"},"schema_version":"1.0","source":{"id":"2501.14662","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.14662","created_at":"2026-07-05T11:40:32Z"},{"alias_kind":"arxiv_version","alias_value":"2501.14662v5","created_at":"2026-07-05T11:40:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14662","created_at":"2026-07-05T11:40:32Z"},{"alias_kind":"pith_short_12","alias_value":"HCOWBKYVQ7SG","created_at":"2026-07-05T11:40:32Z"},{"alias_kind":"pith_short_16","alias_value":"HCOWBKYVQ7SGFW5X","created_at":"2026-07-05T11:40:32Z"},{"alias_kind":"pith_short_8","alias_value":"HCOWBKYV","created_at":"2026-07-05T11:40:32Z"}],"graph_snapshots":[{"event_id":"sha256:44df221084001713c8d534cd74cd48389410b2b680c87f9614f7529f2a04c21c","target":"graph","created_at":"2026-07-05T11:40:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.14662/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mathieu Besan\\c{c}on","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-24T17:35:07Z","title":"Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14662","kind":"arxiv","version":5},"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:e3fab3bdd8f6bb6df813c2f768865285cdd7d819680c4ee3645a2a5b3622d560","target":"record","created_at":"2026-07-05T11:40:32Z","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":"7c213be91cb5675b1077c3fd67d832597913bfa609b28f124018e2c278b8ad7b","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-24T17:35:07Z","title_canon_sha256":"2247839bb777ad6149d08e841d1af8b70f4686684b709eacb593e8ac049a8f24"},"schema_version":"1.0","source":{"id":"2501.14662","kind":"arxiv","version":5}},"canonical_sha256":"389d60ab1587e462dbb7ea097b04e2ebd6f4245b5e5aac66a7ea08dbec186a20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"389d60ab1587e462dbb7ea097b04e2ebd6f4245b5e5aac66a7ea08dbec186a20","first_computed_at":"2026-07-05T11:40:32.423118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:40:32.423118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ohmYU3sRczkvs+DlEmNVOOlFpXB52Q5VdLoRNUZTE/9+5kef+LyRcD8lx0GOgMkorteDymM6uU8Rbd3BwpOQBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:40:32.423594Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.14662","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3fab3bdd8f6bb6df813c2f768865285cdd7d819680c4ee3645a2a5b3622d560","sha256:44df221084001713c8d534cd74cd48389410b2b680c87f9614f7529f2a04c21c"],"state_sha256":"73c30815ecf9dbe9f88ae67d758ca9e6e22ae166474fbdf345bf1179dd49141d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+iWmnbQGxp1JrmRaDgZoKbdBKeeg33NZq55g93uTIqysyPK1wXFOVHNE8aW5sLym6tTmviJe8w+xqU9UA/vzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T06:13:53.617570Z","bundle_sha256":"375eea44119c88aaeef774d51cd9f237f6dfde0179d987ce5cfc8da680db2e85"}}