{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FM4GSJXROV5ACTJXF3T6OERZSV","short_pith_number":"pith:FM4GSJXR","schema_version":"1.0","canonical_sha256":"2b386926f1757a014d372ee7e71239956f75b733c4d7ee504273ab4bfa3b4f5f","source":{"kind":"arxiv","id":"2410.21140","version":3},"attestation_state":"computed","paper":{"title":"A robust optimization approach to flow decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fabricio Oliveira, Moritz Stinzend\\\"orfer, Philine Schiewe","submitted_at":"2024-10-28T15:42:50Z","abstract_excerpt":"In this paper, we generalize the minimum flow decomposition problem (MFD) to incorporate uncertain edge capacities and tackle it from the perspective of robust optimization. In the classical flow decomposition problem, a network flow is decomposed into a set of weighted paths from a fixed source node to a fixed sink node that precisely represents the flow distribution across all edges. MFD problems permeate multiple important applications, including reconstructing genomic sequences to representing the flow of goods or passengers in distribution networks. Inspired by these applications, we gene"},"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":"2410.21140","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-28T15:42:50Z","cross_cats_sorted":[],"title_canon_sha256":"dfd41cf82655b8cb2d6d3548e1211b0c8db06d828a4f053f4a5c716592155b4e","abstract_canon_sha256":"623ff706ae055a409662ee920de5cd3b7261ea74f29ab92af39e2c592664203a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:36.986239Z","signature_b64":"9sldbjrVPLC6dLULvWNp4SWl0H+aEUoKMCK8u7YF4RE+8Km/cuhy1Yk2uxM0gcs4VDnYQkJSL/60s3zDw9cOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b386926f1757a014d372ee7e71239956f75b733c4d7ee504273ab4bfa3b4f5f","last_reissued_at":"2026-06-04T01:09:36.985646Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:36.985646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A robust optimization approach to flow decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fabricio Oliveira, Moritz Stinzend\\\"orfer, Philine Schiewe","submitted_at":"2024-10-28T15:42:50Z","abstract_excerpt":"In this paper, we generalize the minimum flow decomposition problem (MFD) to incorporate uncertain edge capacities and tackle it from the perspective of robust optimization. In the classical flow decomposition problem, a network flow is decomposed into a set of weighted paths from a fixed source node to a fixed sink node that precisely represents the flow distribution across all edges. MFD problems permeate multiple important applications, including reconstructing genomic sequences to representing the flow of goods or passengers in distribution networks. Inspired by these applications, we gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21140","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.21140/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":"2410.21140","created_at":"2026-06-04T01:09:36.985716+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.21140v3","created_at":"2026-06-04T01:09:36.985716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21140","created_at":"2026-06-04T01:09:36.985716+00:00"},{"alias_kind":"pith_short_12","alias_value":"FM4GSJXROV5A","created_at":"2026-06-04T01:09:36.985716+00:00"},{"alias_kind":"pith_short_16","alias_value":"FM4GSJXROV5ACTJX","created_at":"2026-06-04T01:09:36.985716+00:00"},{"alias_kind":"pith_short_8","alias_value":"FM4GSJXR","created_at":"2026-06-04T01:09:36.985716+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/FM4GSJXROV5ACTJXF3T6OERZSV","json":"https://pith.science/pith/FM4GSJXROV5ACTJXF3T6OERZSV.json","graph_json":"https://pith.science/api/pith-number/FM4GSJXROV5ACTJXF3T6OERZSV/graph.json","events_json":"https://pith.science/api/pith-number/FM4GSJXROV5ACTJXF3T6OERZSV/events.json","paper":"https://pith.science/paper/FM4GSJXR"},"agent_actions":{"view_html":"https://pith.science/pith/FM4GSJXROV5ACTJXF3T6OERZSV","download_json":"https://pith.science/pith/FM4GSJXROV5ACTJXF3T6OERZSV.json","view_paper":"https://pith.science/paper/FM4GSJXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.21140&json=true","fetch_graph":"https://pith.science/api/pith-number/FM4GSJXROV5ACTJXF3T6OERZSV/graph.json","fetch_events":"https://pith.science/api/pith-number/FM4GSJXROV5ACTJXF3T6OERZSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FM4GSJXROV5ACTJXF3T6OERZSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FM4GSJXROV5ACTJXF3T6OERZSV/action/storage_attestation","attest_author":"https://pith.science/pith/FM4GSJXROV5ACTJXF3T6OERZSV/action/author_attestation","sign_citation":"https://pith.science/pith/FM4GSJXROV5ACTJXF3T6OERZSV/action/citation_signature","submit_replication":"https://pith.science/pith/FM4GSJXROV5ACTJXF3T6OERZSV/action/replication_record"}},"created_at":"2026-06-04T01:09:36.985716+00:00","updated_at":"2026-06-04T01:09:36.985716+00:00"}