{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HAJNEUM5LKHJBMH5QBZCL5FLNY","short_pith_number":"pith:HAJNEUM5","canonical_record":{"source":{"id":"1412.4980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-16T12:38:42Z","cross_cats_sorted":[],"title_canon_sha256":"91ed3697a2f3b02c7e04bb3ebda43093032e724cae07cb4b526189f3a7f9e0d9","abstract_canon_sha256":"c2b5a2370a14e89bd7f20eb50af8f87341124014370571e16da64c7290a32777"},"schema_version":"1.0"},"canonical_sha256":"3812d2519d5a8e90b0fd807225f4ab6e35fa1be8d1cf6905831e537f56cdf335","source":{"kind":"arxiv","id":"1412.4980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4980","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4980v1","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4980","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"pith_short_12","alias_value":"HAJNEUM5LKHJ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HAJNEUM5LKHJBMH5","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HAJNEUM5","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HAJNEUM5LKHJBMH5QBZCL5FLNY","target":"record","payload":{"canonical_record":{"source":{"id":"1412.4980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-16T12:38:42Z","cross_cats_sorted":[],"title_canon_sha256":"91ed3697a2f3b02c7e04bb3ebda43093032e724cae07cb4b526189f3a7f9e0d9","abstract_canon_sha256":"c2b5a2370a14e89bd7f20eb50af8f87341124014370571e16da64c7290a32777"},"schema_version":"1.0"},"canonical_sha256":"3812d2519d5a8e90b0fd807225f4ab6e35fa1be8d1cf6905831e537f56cdf335","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:09.964532Z","signature_b64":"wuUPMAMTzT11XuSNWCkpsM0fmy/5WM4Z7gEByt5CVu8pZzzAeZpupypZJ+PiPd2Zfj40PEH/+JtwdmSJI227Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3812d2519d5a8e90b0fd807225f4ab6e35fa1be8d1cf6905831e537f56cdf335","last_reissued_at":"2026-05-18T02:31:09.964043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:09.964043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.4980","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:31:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o98xC8vw8OzOtvHGhVlEF1fYtIqrJXkKvk529FbBChDcj8sdIuJYIPbW75lWc7/FfmpnFBWd2OyEQuhz7d4cBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:21:50.159511Z"},"content_sha256":"68c6abb57a7a35de0102582564ae1e90ad191dda3c78fb98449f3818d91a838d","schema_version":"1.0","event_id":"sha256:68c6abb57a7a35de0102582564ae1e90ad191dda3c78fb98449f3818d91a838d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HAJNEUM5LKHJBMH5QBZCL5FLNY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Virtual Machine Migration Planning in Software-Defined Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Depeng Jin, Huandong Wang, Ying Zhang, Yong Li","submitted_at":"2014-12-16T12:38:42Z","abstract_excerpt":"In this paper, we examine the problem of how to schedule the migrations and how to allocate network resources for migration when multiple VMs need to be migrated at the same time. We consider the problem in the Software-defined Network (SDN) context since it provides flexible control on routing. More specifically, we propose a method that computes the optimal migration sequence and network bandwidth used for each migration. We formulate this problem as a mixed integer programming, which is NP-hard. To make it computationally feasible for large scale data centers, we propose an approximation sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4980","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:31:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8uJd2H0UkGE52gd7QQrQ7XplY25lzqhaORjY4Kd340xgWtUVZEEMSyP458lwooTZEenXIgp/a2+B02+7pritBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:21:50.159860Z"},"content_sha256":"70539d4349641cba21f0c690ed0093b537b494a37b814388293d10781e67c64f","schema_version":"1.0","event_id":"sha256:70539d4349641cba21f0c690ed0093b537b494a37b814388293d10781e67c64f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAJNEUM5LKHJBMH5QBZCL5FLNY/bundle.json","state_url":"https://pith.science/pith/HAJNEUM5LKHJBMH5QBZCL5FLNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAJNEUM5LKHJBMH5QBZCL5FLNY/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-03T09:21:50Z","links":{"resolver":"https://pith.science/pith/HAJNEUM5LKHJBMH5QBZCL5FLNY","bundle":"https://pith.science/pith/HAJNEUM5LKHJBMH5QBZCL5FLNY/bundle.json","state":"https://pith.science/pith/HAJNEUM5LKHJBMH5QBZCL5FLNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAJNEUM5LKHJBMH5QBZCL5FLNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HAJNEUM5LKHJBMH5QBZCL5FLNY","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":"c2b5a2370a14e89bd7f20eb50af8f87341124014370571e16da64c7290a32777","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-16T12:38:42Z","title_canon_sha256":"91ed3697a2f3b02c7e04bb3ebda43093032e724cae07cb4b526189f3a7f9e0d9"},"schema_version":"1.0","source":{"id":"1412.4980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4980","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4980v1","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4980","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"pith_short_12","alias_value":"HAJNEUM5LKHJ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HAJNEUM5LKHJBMH5","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HAJNEUM5","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:70539d4349641cba21f0c690ed0093b537b494a37b814388293d10781e67c64f","target":"graph","created_at":"2026-05-18T02:31:09Z","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":"In this paper, we examine the problem of how to schedule the migrations and how to allocate network resources for migration when multiple VMs need to be migrated at the same time. We consider the problem in the Software-defined Network (SDN) context since it provides flexible control on routing. More specifically, we propose a method that computes the optimal migration sequence and network bandwidth used for each migration. We formulate this problem as a mixed integer programming, which is NP-hard. To make it computationally feasible for large scale data centers, we propose an approximation sc","authors_text":"Depeng Jin, Huandong Wang, Ying Zhang, Yong Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-16T12:38:42Z","title":"Virtual Machine Migration Planning in Software-Defined Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4980","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:68c6abb57a7a35de0102582564ae1e90ad191dda3c78fb98449f3818d91a838d","target":"record","created_at":"2026-05-18T02:31:09Z","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":"c2b5a2370a14e89bd7f20eb50af8f87341124014370571e16da64c7290a32777","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-16T12:38:42Z","title_canon_sha256":"91ed3697a2f3b02c7e04bb3ebda43093032e724cae07cb4b526189f3a7f9e0d9"},"schema_version":"1.0","source":{"id":"1412.4980","kind":"arxiv","version":1}},"canonical_sha256":"3812d2519d5a8e90b0fd807225f4ab6e35fa1be8d1cf6905831e537f56cdf335","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3812d2519d5a8e90b0fd807225f4ab6e35fa1be8d1cf6905831e537f56cdf335","first_computed_at":"2026-05-18T02:31:09.964043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:09.964043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wuUPMAMTzT11XuSNWCkpsM0fmy/5WM4Z7gEByt5CVu8pZzzAeZpupypZJ+PiPd2Zfj40PEH/+JtwdmSJI227Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:09.964532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68c6abb57a7a35de0102582564ae1e90ad191dda3c78fb98449f3818d91a838d","sha256:70539d4349641cba21f0c690ed0093b537b494a37b814388293d10781e67c64f"],"state_sha256":"1eed475752a85b25047adb291276aa62f22fe462519f2020b785d8931e11efaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6C1kv0JIAXSvvfZ3PmBcbR4f69TJvN2XjICaTXBJ4YfSwJJ+CQERRpgTVsIktu5SwgHQ1eETexGZE+MJ5vzBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:21:50.161837Z","bundle_sha256":"fdffcedd10753e630914becbb86571da6e754f372c97ae296888951d619e315e"}}