{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:56L2B67CFAOZVYXY4OBPL63QYG","short_pith_number":"pith:56L2B67C","canonical_record":{"source":{"id":"1806.08871","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-06-22T22:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"a9525414f086a133833b8d70bfe8f0cd1448dae3d7366f0fe336e30d1839a7bf","abstract_canon_sha256":"eb2f89a9fd013b68ff2f7f1537326635ad21aae9e4929b03ed9675d18a098f99"},"schema_version":"1.0"},"canonical_sha256":"ef97a0fbe2281d9ae2f8e382f5fb70c19e3bab8123b450e4dc6c1679077ff2ae","source":{"kind":"arxiv","id":"1806.08871","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08871","created_at":"2026-05-18T00:12:31Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08871v1","created_at":"2026-05-18T00:12:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08871","created_at":"2026-05-18T00:12:31Z"},{"alias_kind":"pith_short_12","alias_value":"56L2B67CFAOZ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"56L2B67CFAOZVYXY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"56L2B67C","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:56L2B67CFAOZVYXY4OBPL63QYG","target":"record","payload":{"canonical_record":{"source":{"id":"1806.08871","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-06-22T22:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"a9525414f086a133833b8d70bfe8f0cd1448dae3d7366f0fe336e30d1839a7bf","abstract_canon_sha256":"eb2f89a9fd013b68ff2f7f1537326635ad21aae9e4929b03ed9675d18a098f99"},"schema_version":"1.0"},"canonical_sha256":"ef97a0fbe2281d9ae2f8e382f5fb70c19e3bab8123b450e4dc6c1679077ff2ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:31.039163Z","signature_b64":"2lYpcJgwdFdW+awOlkGQ0yKFO6nscfABDdlvisEF11jdES0ODPFq70xgTiOjI2vSDMO46w0kB++pJTsvvQhZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef97a0fbe2281d9ae2f8e382f5fb70c19e3bab8123b450e4dc6c1679077ff2ae","last_reissued_at":"2026-05-18T00:12:31.038653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:31.038653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.08871","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-18T00:12:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y4g4uVDMaLImjnFGMM4M54+YclIjzpVZ+95sgWi2p/L2PAR5EB1YcElFBqMRXfbZmr2O9NLBpcNuTvzo/z86Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:12:34.064045Z"},"content_sha256":"e52f15c79bdec08b906c242815ff913f85274cfb222811eb800480cffd34f33a","schema_version":"1.0","event_id":"sha256:e52f15c79bdec08b906c242815ff913f85274cfb222811eb800480cffd34f33a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:56L2B67CFAOZVYXY4OBPL63QYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lagrange decomposition based Branch and Bound algorithm for the Optimal Mapping of Cloud Virtual Machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adam Ouorou, Guanglei Wang, Walid Ben-Ameur","submitted_at":"2018-06-22T22:30:09Z","abstract_excerpt":"One of the challenges of cloud computing is to optimally and efficiently assign virtual ma- chines to physical machines. The aim of telecommunication operators is to minimize the map- ping cost while respecting constraints regarding location, assignment and capacity. In this paper we first propose an exact formulation leading to a 0-1 bilinear constrained problem. Then we introduce a variety of linear cuts by exploiting the problem structure and present a Lagrange decomposition based B&B algorithm to obtain optimal solutions efficiently. Numerically, we show that our valid inequalities close o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08871","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-18T00:12:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGSHP0qwUqN8/fbLOCUccvMm2GIct3of+ezmICK2bGpgjytmr7L9GoJGsbMhx6tfAFvDJfJl3V0T0POGCezaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:12:34.064413Z"},"content_sha256":"ce9fb02b5101ab8c6a19965941073c7cbc7556bd9b829c9951a5c6e33f8299de","schema_version":"1.0","event_id":"sha256:ce9fb02b5101ab8c6a19965941073c7cbc7556bd9b829c9951a5c6e33f8299de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG/bundle.json","state_url":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56L2B67CFAOZVYXY4OBPL63QYG/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-05-27T08:12:34Z","links":{"resolver":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG","bundle":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG/bundle.json","state":"https://pith.science/pith/56L2B67CFAOZVYXY4OBPL63QYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56L2B67CFAOZVYXY4OBPL63QYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:56L2B67CFAOZVYXY4OBPL63QYG","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":"eb2f89a9fd013b68ff2f7f1537326635ad21aae9e4929b03ed9675d18a098f99","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-06-22T22:30:09Z","title_canon_sha256":"a9525414f086a133833b8d70bfe8f0cd1448dae3d7366f0fe336e30d1839a7bf"},"schema_version":"1.0","source":{"id":"1806.08871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08871","created_at":"2026-05-18T00:12:31Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08871v1","created_at":"2026-05-18T00:12:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08871","created_at":"2026-05-18T00:12:31Z"},{"alias_kind":"pith_short_12","alias_value":"56L2B67CFAOZ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"56L2B67CFAOZVYXY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"56L2B67C","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:ce9fb02b5101ab8c6a19965941073c7cbc7556bd9b829c9951a5c6e33f8299de","target":"graph","created_at":"2026-05-18T00:12: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":"One of the challenges of cloud computing is to optimally and efficiently assign virtual ma- chines to physical machines. The aim of telecommunication operators is to minimize the map- ping cost while respecting constraints regarding location, assignment and capacity. In this paper we first propose an exact formulation leading to a 0-1 bilinear constrained problem. Then we introduce a variety of linear cuts by exploiting the problem structure and present a Lagrange decomposition based B&B algorithm to obtain optimal solutions efficiently. Numerically, we show that our valid inequalities close o","authors_text":"Adam Ouorou, Guanglei Wang, Walid Ben-Ameur","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-06-22T22:30:09Z","title":"A Lagrange decomposition based Branch and Bound algorithm for the Optimal Mapping of Cloud Virtual Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08871","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:e52f15c79bdec08b906c242815ff913f85274cfb222811eb800480cffd34f33a","target":"record","created_at":"2026-05-18T00:12: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":"eb2f89a9fd013b68ff2f7f1537326635ad21aae9e4929b03ed9675d18a098f99","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-06-22T22:30:09Z","title_canon_sha256":"a9525414f086a133833b8d70bfe8f0cd1448dae3d7366f0fe336e30d1839a7bf"},"schema_version":"1.0","source":{"id":"1806.08871","kind":"arxiv","version":1}},"canonical_sha256":"ef97a0fbe2281d9ae2f8e382f5fb70c19e3bab8123b450e4dc6c1679077ff2ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef97a0fbe2281d9ae2f8e382f5fb70c19e3bab8123b450e4dc6c1679077ff2ae","first_computed_at":"2026-05-18T00:12:31.038653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:31.038653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2lYpcJgwdFdW+awOlkGQ0yKFO6nscfABDdlvisEF11jdES0ODPFq70xgTiOjI2vSDMO46w0kB++pJTsvvQhZCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:31.039163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e52f15c79bdec08b906c242815ff913f85274cfb222811eb800480cffd34f33a","sha256:ce9fb02b5101ab8c6a19965941073c7cbc7556bd9b829c9951a5c6e33f8299de"],"state_sha256":"57f4e7b8187f515ed2621594d427961e21bf6ff8685d2f2f4b93bced9b9c5405"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nj/3VX7O1fhcMi/Q7p3kXz/2XSDn04muH+4mJthtsRG5Hu1cMe3v4YBZpLhUCAsdojkvVXf5QmTqmf5QKVM2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:12:34.067407Z","bundle_sha256":"1249377603b2df55dae38559ba83073110d1a40e00def5eae5b0f7bb01a45f41"}}