{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:J5FHD5LWKRPYXLLJPUW7Z5T4PF","short_pith_number":"pith:J5FHD5LW","schema_version":"1.0","canonical_sha256":"4f4a71f576545f8bad697d2dfcf67c79565517f6cf730c7bad749548973f72c8","source":{"kind":"arxiv","id":"2607.10459","version":1},"attestation_state":"computed","paper":{"title":"A column generation-based fixed-point heuristic for the service-aware multi-commodity flow problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Richard Martin Lusby, Siv Marie Cartland Hansen","submitted_at":"2026-07-11T19:48:51Z","abstract_excerpt":"We study the Service-Aware Multi-Commodity Flow (SAMCF) problem, in which demand is elastic and governed by a logit choice model while routing is subject to hard capacity constraints. In a centralized, system-optimal setting, the network operator jointly determines how much demand to serve and how to route it. We formulate the SAMCF as a nonlinear program and propose an iterative fixed-point heuristic that alternates between solving an inelastic MCF via column generation and updating demand from the resulting service levels. Two linear approximations based on piecewise-linear demand functions "},"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":"2607.10459","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-11T19:48:51Z","cross_cats_sorted":[],"title_canon_sha256":"254f5399c9b40f1c7ea53f8bf61e52774191dd9cd00f9e85820b7c25b9a36dee","abstract_canon_sha256":"9d8ad06e2151e9ac94fcc82425d7dce528c14a0589f5c59d0a0d6d70fa74b367"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:21:16.925427Z","signature_b64":"UYjJat1Z8KpLzbAey9B2wtOe4qFkEEbDMAFI27O4xf7/hI78UavZpKQ+BU7UydIFkXLap1afI9Crz4DwwT2gAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f4a71f576545f8bad697d2dfcf67c79565517f6cf730c7bad749548973f72c8","last_reissued_at":"2026-07-14T01:21:16.924588Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:21:16.924588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A column generation-based fixed-point heuristic for the service-aware multi-commodity flow problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Richard Martin Lusby, Siv Marie Cartland Hansen","submitted_at":"2026-07-11T19:48:51Z","abstract_excerpt":"We study the Service-Aware Multi-Commodity Flow (SAMCF) problem, in which demand is elastic and governed by a logit choice model while routing is subject to hard capacity constraints. In a centralized, system-optimal setting, the network operator jointly determines how much demand to serve and how to route it. We formulate the SAMCF as a nonlinear program and propose an iterative fixed-point heuristic that alternates between solving an inelastic MCF via column generation and updating demand from the resulting service levels. Two linear approximations based on piecewise-linear demand functions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10459","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.10459/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":"2607.10459","created_at":"2026-07-14T01:21:16.925026+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.10459v1","created_at":"2026-07-14T01:21:16.925026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10459","created_at":"2026-07-14T01:21:16.925026+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5FHD5LWKRPY","created_at":"2026-07-14T01:21:16.925026+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5FHD5LWKRPYXLLJ","created_at":"2026-07-14T01:21:16.925026+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5FHD5LW","created_at":"2026-07-14T01:21:16.925026+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.13263","citing_title":"An ALNS Heuristic for Large-Scale Line Planning with Mode Choice and Line Generation","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J5FHD5LWKRPYXLLJPUW7Z5T4PF","json":"https://pith.science/pith/J5FHD5LWKRPYXLLJPUW7Z5T4PF.json","graph_json":"https://pith.science/api/pith-number/J5FHD5LWKRPYXLLJPUW7Z5T4PF/graph.json","events_json":"https://pith.science/api/pith-number/J5FHD5LWKRPYXLLJPUW7Z5T4PF/events.json","paper":"https://pith.science/paper/J5FHD5LW"},"agent_actions":{"view_html":"https://pith.science/pith/J5FHD5LWKRPYXLLJPUW7Z5T4PF","download_json":"https://pith.science/pith/J5FHD5LWKRPYXLLJPUW7Z5T4PF.json","view_paper":"https://pith.science/paper/J5FHD5LW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.10459&json=true","fetch_graph":"https://pith.science/api/pith-number/J5FHD5LWKRPYXLLJPUW7Z5T4PF/graph.json","fetch_events":"https://pith.science/api/pith-number/J5FHD5LWKRPYXLLJPUW7Z5T4PF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5FHD5LWKRPYXLLJPUW7Z5T4PF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5FHD5LWKRPYXLLJPUW7Z5T4PF/action/storage_attestation","attest_author":"https://pith.science/pith/J5FHD5LWKRPYXLLJPUW7Z5T4PF/action/author_attestation","sign_citation":"https://pith.science/pith/J5FHD5LWKRPYXLLJPUW7Z5T4PF/action/citation_signature","submit_replication":"https://pith.science/pith/J5FHD5LWKRPYXLLJPUW7Z5T4PF/action/replication_record"}},"created_at":"2026-07-14T01:21:16.925026+00:00","updated_at":"2026-07-14T01:21:16.925026+00:00"}