{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5IETWTIAU6JH3UL545F3NWMHYX","short_pith_number":"pith:5IETWTIA","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"},"canonical_sha256":"ea093b4d00a7927dd17de74bb6d987c5f7fc5f50f69e24d523a2a638e2c2ccf2","source":{"kind":"arxiv","id":"1410.1409","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1409","created_at":"2026-05-18T01:08:27Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1409v1","created_at":"2026-05-18T01:08:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1409","created_at":"2026-05-18T01:08:27Z"},{"alias_kind":"pith_short_12","alias_value":"5IETWTIAU6JH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5IETWTIAU6JH3UL5","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5IETWTIA","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5IETWTIAU6JH3UL545F3NWMHYX","target":"record","payload":{"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"},"canonical_sha256":"ea093b4d00a7927dd17de74bb6d987c5f7fc5f50f69e24d523a2a638e2c2ccf2","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"},"source_kind":"arxiv","source_id":"1410.1409","source_version":1,"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-05-18T01:08:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ejbd/fWSO0s2RpFB0twL+/BuWu9k3YP1iIsoq0GAb2uQtWFez4sxXtXE/Dgjw65+QenFNxeAGFQmMO8sKiqJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:36:18.966670Z"},"content_sha256":"61a47f51a0b986684f657a09b463d7f9670a099bc525ac2389ad467c01b4880f","schema_version":"1.0","event_id":"sha256:61a47f51a0b986684f657a09b463d7f9670a099bc525ac2389ad467c01b4880f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5IETWTIAU6JH3UL545F3NWMHYX","target":"graph","payload":{"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"},"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-05-18T01:08:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NI19mLIYQBk4ya1QY6GyIeey1iomPWPrbuMshAQBjzshiVOe0J7rROVuEsNFCgH7Fl6+ytCxso3iSn59xs1zCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:36:18.967021Z"},"content_sha256":"37b8740a9c139caa7e02d7915afb0d89dda3c881c4cc88f65f5f01027f337899","schema_version":"1.0","event_id":"sha256:37b8740a9c139caa7e02d7915afb0d89dda3c881c4cc88f65f5f01027f337899"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX/bundle.json","state_url":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IETWTIAU6JH3UL545F3NWMHYX/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-06-02T02:36:18Z","links":{"resolver":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX","bundle":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX/bundle.json","state":"https://pith.science/pith/5IETWTIAU6JH3UL545F3NWMHYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IETWTIAU6JH3UL545F3NWMHYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5IETWTIAU6JH3UL545F3NWMHYX","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":"938a42f73f8fd2092d1a8cc07e862e9b7fa704dabe5ef6ecdc2c622a8fe652ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-25T20:57:10Z","title_canon_sha256":"4542b812fcad45776e4220ad59bb6611f1026179b734b8b4255bfb5bb6a550ae"},"schema_version":"1.0","source":{"id":"1410.1409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1409","created_at":"2026-05-18T01:08:27Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1409v1","created_at":"2026-05-18T01:08:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1409","created_at":"2026-05-18T01:08:27Z"},{"alias_kind":"pith_short_12","alias_value":"5IETWTIAU6JH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5IETWTIAU6JH3UL5","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5IETWTIA","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:37b8740a9c139caa7e02d7915afb0d89dda3c881c4cc88f65f5f01027f337899","target":"graph","created_at":"2026-05-18T01:08:27Z","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"},"paper":{"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.","authors_text":"Karen Aardal, Pierre Le Bodic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-25T20:57:10Z","title":"Approximation algorithms for the Transportation Problem with Market Choice and related models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1409","kind":"arxiv","version":1},"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:61a47f51a0b986684f657a09b463d7f9670a099bc525ac2389ad467c01b4880f","target":"record","created_at":"2026-05-18T01:08:27Z","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":"938a42f73f8fd2092d1a8cc07e862e9b7fa704dabe5ef6ecdc2c622a8fe652ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-25T20:57:10Z","title_canon_sha256":"4542b812fcad45776e4220ad59bb6611f1026179b734b8b4255bfb5bb6a550ae"},"schema_version":"1.0","source":{"id":"1410.1409","kind":"arxiv","version":1}},"canonical_sha256":"ea093b4d00a7927dd17de74bb6d987c5f7fc5f50f69e24d523a2a638e2c2ccf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea093b4d00a7927dd17de74bb6d987c5f7fc5f50f69e24d523a2a638e2c2ccf2","first_computed_at":"2026-05-18T01:08:27.468472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:27.468472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x4HvgaSVXCuvcwW77m9Pv/sYd0ImDSc1Q9PeKc+ESNhGyidzGBWYJo9k7SpyEWF9/i02e36rv+GdtTGe7YLVBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:27.469647Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61a47f51a0b986684f657a09b463d7f9670a099bc525ac2389ad467c01b4880f","sha256:37b8740a9c139caa7e02d7915afb0d89dda3c881c4cc88f65f5f01027f337899"],"state_sha256":"f83e8281dd03ac92473389dde65275ff01385e1308b15475990657cd29aa115e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y4cZGyFHJp9DkYO4NWfKjQJwpUNcL9ctMNvQIG4natD/lxzI+QQTiTXVLgvqBGFc9MJ2dG5DLhmofs9YerUzBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:36:18.969269Z","bundle_sha256":"631720148bd30387fca9a182d7b4de225878a07f2877e65305cec263749dba11"}}