{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5IETWTIAU6JH3UL545F3NWMHYX","short_pith_number":"pith:5IETWTIA","schema_version":"1.0","canonical_sha256":"ea093b4d00a7927dd17de74bb6d987c5f7fc5f50f69e24d523a2a638e2c2ccf2","source":{"kind":"arxiv","id":"1410.1409","version":1},"attestation_state":"computed","paper":{"title":"Approximation algorithms for the Transportation Problem with Market Choice and related models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Karen Aardal, Pierre Le Bodic","submitted_at":"2014-09-25T20:57:10Z","abstract_excerpt":"Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the clients into unserved clients, paying the penalties, and into served clients, paying the transportation cost to serve them. We give polynomial-time reductions from this problem and variants to the (un)capacitated facility location problem, directly yielding approximation algorithms, two with constant factors in the metric case, one with a logarithmic factor in the general case."},"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":"1410.1409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-25T20:57:10Z","cross_cats_sorted":[],"title_canon_sha256":"4542b812fcad45776e4220ad59bb6611f1026179b734b8b4255bfb5bb6a550ae","abstract_canon_sha256":"938a42f73f8fd2092d1a8cc07e862e9b7fa704dabe5ef6ecdc2c622a8fe652ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:27.469647Z","signature_b64":"x4HvgaSVXCuvcwW77m9Pv/sYd0ImDSc1Q9PeKc+ESNhGyidzGBWYJo9k7SpyEWF9/i02e36rv+GdtTGe7YLVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea093b4d00a7927dd17de74bb6d987c5f7fc5f50f69e24d523a2a638e2c2ccf2","last_reissued_at":"2026-05-18T01:08:27.468472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:27.468472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation algorithms for the Transportation Problem with Market Choice and related models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Karen Aardal, Pierre Le Bodic","submitted_at":"2014-09-25T20:57:10Z","abstract_excerpt":"Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the clients into unserved clients, paying the penalties, and into served clients, paying the transportation cost to serve them. We give polynomial-time reductions from this problem and variants to the (un)capacitated facility location problem, directly yielding approximation algorithms, two with constant factors in the metric case, one with a logarithmic factor in the general case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1409","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":""},"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":"1410.1409","created_at":"2026-05-18T01:08:27.468800+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.1409v1","created_at":"2026-05-18T01:08:27.468800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1409","created_at":"2026-05-18T01:08:27.468800+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IETWTIAU6JH","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IETWTIAU6JH3UL5","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IETWTIA","created_at":"2026-05-18T12:28:14.216126+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/5IETWTIAU6JH3UL545F3NWMHYX","json":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX.json","graph_json":"https://pith.science/api/pith-number/5IETWTIAU6JH3UL545F3NWMHYX/graph.json","events_json":"https://pith.science/api/pith-number/5IETWTIAU6JH3UL545F3NWMHYX/events.json","paper":"https://pith.science/paper/5IETWTIA"},"agent_actions":{"view_html":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX","download_json":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX.json","view_paper":"https://pith.science/paper/5IETWTIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.1409&json=true","fetch_graph":"https://pith.science/api/pith-number/5IETWTIAU6JH3UL545F3NWMHYX/graph.json","fetch_events":"https://pith.science/api/pith-number/5IETWTIAU6JH3UL545F3NWMHYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX/action/storage_attestation","attest_author":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX/action/author_attestation","sign_citation":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX/action/citation_signature","submit_replication":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX/action/replication_record"}},"created_at":"2026-05-18T01:08:27.468800+00:00","updated_at":"2026-05-18T01:08:27.468800+00:00"}