{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SO2GZQLLCIBACYLJNFYZKVMOK6","short_pith_number":"pith:SO2GZQLL","canonical_record":{"source":{"id":"1402.2309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-10T21:23:58Z","cross_cats_sorted":[],"title_canon_sha256":"78db7929d254c8580986248e24bdd842f79c919ec8c017994621ea2a1a1469e6","abstract_canon_sha256":"bc61e2ebcfdc89082cf1c62cf90fc81c01e3630496fccc134146413192149b00"},"schema_version":"1.0"},"canonical_sha256":"93b46cc16b1202016169697195558e57b9932fb43b5918e2e1e5bb91c3cb82a9","source":{"kind":"arxiv","id":"1402.2309","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2309","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2309v1","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2309","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"pith_short_12","alias_value":"SO2GZQLLCIBA","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SO2GZQLLCIBACYLJ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SO2GZQLL","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SO2GZQLLCIBACYLJNFYZKVMOK6","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-10T21:23:58Z","cross_cats_sorted":[],"title_canon_sha256":"78db7929d254c8580986248e24bdd842f79c919ec8c017994621ea2a1a1469e6","abstract_canon_sha256":"bc61e2ebcfdc89082cf1c62cf90fc81c01e3630496fccc134146413192149b00"},"schema_version":"1.0"},"canonical_sha256":"93b46cc16b1202016169697195558e57b9932fb43b5918e2e1e5bb91c3cb82a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:31.193591Z","signature_b64":"eowQub0RlLkiRoM5lwfK0N1ui/7J+U/9ol2VT5F++hP6IKCYnZosYwAYCVPmFGhtlEc9n9vkV4+DbY6ARjTYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93b46cc16b1202016169697195558e57b9932fb43b5918e2e1e5bb91c3cb82a9","last_reissued_at":"2026-05-18T02:59:31.192860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:31.192860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2309","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-18T02:59:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"92kqX3bG85DwLAOLAH5tkkmlgdXdUZdCLLChUZ/gxjPB03mgcRge5W5gjOh/tpdp9xfN3xVVHYKSOIxv+m8LBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T04:22:56.679700Z"},"content_sha256":"2ce3548d08ee00f7807e3ea5183da6fca1ae6e8d7244f1d36b496ff114719129","schema_version":"1.0","event_id":"sha256:2ce3548d08ee00f7807e3ea5183da6fca1ae6e8d7244f1d36b496ff114719129"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SO2GZQLLCIBACYLJNFYZKVMOK6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsity-Constrained Transportation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Annie I. Chen, Stephen C. Graves","submitted_at":"2014-02-10T21:23:58Z","abstract_excerpt":"We study the solution of a large-scale transportation problem with an additional constraint on the sparsity of inbound flows. Such problems arise in the management of inventory for online retailers that operate with many order fulfillment centers; each stock-keeping unit is typically kept in a limited number of these order fulfillment centers so as to reduce the operational overhead in the supply chain network.\n  We propose a computationally efficient algorithm that solves this sparsity-constrained optimization problem while bypassing complexities of the conventional integer programming approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2309","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-18T02:59:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhXZ40GHY031vG1LhFAOCILa7TjN18IssKJZocipe/2Zk2RZNsXTO99ycjKzBjaGfW314KGU2UTGa3Ra0ZiZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T04:22:56.680034Z"},"content_sha256":"5a0a35cc607ec538751e949c922052d1a2abadd468b5b1cf3fcd1b719cad57da","schema_version":"1.0","event_id":"sha256:5a0a35cc607ec538751e949c922052d1a2abadd468b5b1cf3fcd1b719cad57da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SO2GZQLLCIBACYLJNFYZKVMOK6/bundle.json","state_url":"https://pith.science/pith/SO2GZQLLCIBACYLJNFYZKVMOK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SO2GZQLLCIBACYLJNFYZKVMOK6/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-07-04T04:22:56Z","links":{"resolver":"https://pith.science/pith/SO2GZQLLCIBACYLJNFYZKVMOK6","bundle":"https://pith.science/pith/SO2GZQLLCIBACYLJNFYZKVMOK6/bundle.json","state":"https://pith.science/pith/SO2GZQLLCIBACYLJNFYZKVMOK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SO2GZQLLCIBACYLJNFYZKVMOK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SO2GZQLLCIBACYLJNFYZKVMOK6","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":"bc61e2ebcfdc89082cf1c62cf90fc81c01e3630496fccc134146413192149b00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-10T21:23:58Z","title_canon_sha256":"78db7929d254c8580986248e24bdd842f79c919ec8c017994621ea2a1a1469e6"},"schema_version":"1.0","source":{"id":"1402.2309","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2309","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2309v1","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2309","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"pith_short_12","alias_value":"SO2GZQLLCIBA","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SO2GZQLLCIBACYLJ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SO2GZQLL","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:5a0a35cc607ec538751e949c922052d1a2abadd468b5b1cf3fcd1b719cad57da","target":"graph","created_at":"2026-05-18T02:59:31Z","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":"We study the solution of a large-scale transportation problem with an additional constraint on the sparsity of inbound flows. Such problems arise in the management of inventory for online retailers that operate with many order fulfillment centers; each stock-keeping unit is typically kept in a limited number of these order fulfillment centers so as to reduce the operational overhead in the supply chain network.\n  We propose a computationally efficient algorithm that solves this sparsity-constrained optimization problem while bypassing complexities of the conventional integer programming approa","authors_text":"Annie I. Chen, Stephen C. Graves","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-10T21:23:58Z","title":"Sparsity-Constrained Transportation Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2309","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:2ce3548d08ee00f7807e3ea5183da6fca1ae6e8d7244f1d36b496ff114719129","target":"record","created_at":"2026-05-18T02:59:31Z","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":"bc61e2ebcfdc89082cf1c62cf90fc81c01e3630496fccc134146413192149b00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-10T21:23:58Z","title_canon_sha256":"78db7929d254c8580986248e24bdd842f79c919ec8c017994621ea2a1a1469e6"},"schema_version":"1.0","source":{"id":"1402.2309","kind":"arxiv","version":1}},"canonical_sha256":"93b46cc16b1202016169697195558e57b9932fb43b5918e2e1e5bb91c3cb82a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93b46cc16b1202016169697195558e57b9932fb43b5918e2e1e5bb91c3cb82a9","first_computed_at":"2026-05-18T02:59:31.192860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:31.192860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eowQub0RlLkiRoM5lwfK0N1ui/7J+U/9ol2VT5F++hP6IKCYnZosYwAYCVPmFGhtlEc9n9vkV4+DbY6ARjTYAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:31.193591Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2309","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ce3548d08ee00f7807e3ea5183da6fca1ae6e8d7244f1d36b496ff114719129","sha256:5a0a35cc607ec538751e949c922052d1a2abadd468b5b1cf3fcd1b719cad57da"],"state_sha256":"a358d5ad63bc65849df94c0afbac12da81df64725662779d3275342dc72cfd36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DsOgSiDxT0TSG8VuWlvCYYLitQcQwHAh0R5QFNkx5AzZt/nYMgvkpeyE0CEhR3PBhquP81R7Jx2r+OJFnsblAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T04:22:56.682228Z","bundle_sha256":"885b1fd066e128ba202685002cbf28d4d4f41358f8cd8ea5d766a894dec66b41"}}