{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:W4LXDVT43EAKDCK2S6GUC25XYB","short_pith_number":"pith:W4LXDVT4","canonical_record":{"source":{"id":"1804.07051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-19T09:27:03Z","cross_cats_sorted":["cs.DC","cs.NI"],"title_canon_sha256":"19a467e43ec0ee4757890e8a0e113d2d103cccee3d43af9bcdeba9c377866e74","abstract_canon_sha256":"f0355a023d0389959e509e7b46723656e76e18ea5b529a885414fcb29e7a7b13"},"schema_version":"1.0"},"canonical_sha256":"b71771d67cd900a1895a978d416bb7c04bf44726c1acff25ad24373e20c86bd1","source":{"kind":"arxiv","id":"1804.07051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07051","created_at":"2026-05-18T00:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07051v1","created_at":"2026-05-18T00:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07051","created_at":"2026-05-18T00:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"W4LXDVT43EAK","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W4LXDVT43EAKDCK2","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W4LXDVT4","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:W4LXDVT43EAKDCK2S6GUC25XYB","target":"record","payload":{"canonical_record":{"source":{"id":"1804.07051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-19T09:27:03Z","cross_cats_sorted":["cs.DC","cs.NI"],"title_canon_sha256":"19a467e43ec0ee4757890e8a0e113d2d103cccee3d43af9bcdeba9c377866e74","abstract_canon_sha256":"f0355a023d0389959e509e7b46723656e76e18ea5b529a885414fcb29e7a7b13"},"schema_version":"1.0"},"canonical_sha256":"b71771d67cd900a1895a978d416bb7c04bf44726c1acff25ad24373e20c86bd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:03.572931Z","signature_b64":"1dnUIUFP3BezTSqRaYu2ft8n9EYMQ+NTFrjLLF2YXxWFoWJguAcDqWK2FuAUjS6yuMoVuBG/p4RpUmZpNhPkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b71771d67cd900a1895a978d416bb7c04bf44726c1acff25ad24373e20c86bd1","last_reissued_at":"2026-05-18T00:18:03.572393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:03.572393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.07051","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:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wG0ooZJSUuW2/eomDFzxe3VhjZQVCpujBTTH+Bq+CMHwxDOraL9t6W2Vv9MOvhPF1rIWSDY5K264h1d9+auCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:38:05.405108Z"},"content_sha256":"c6fceb3a0e0209c8b49d9573729c00da51168152ee9f82ca1bea3df46d338991","schema_version":"1.0","event_id":"sha256:c6fceb3a0e0209c8b49d9573729c00da51168152ee9f82ca1bea3df46d338991"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:W4LXDVT43EAKDCK2S6GUC25XYB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Timescale Online Optimization of Network Function Virtualization for Service Chaining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI"],"primary_cat":"cs.SY","authors_text":"Georgios B. Giannakis, Iain B. Collings, Ren Ping Liu, Tianyi Chen, Wei Ni, Xiaojing Chen, Xin Wang","submitted_at":"2018-04-19T09:27:03Z","abstract_excerpt":"Network Function Virtualization (NFV) can cost-efficiently provide network services by running different virtual network functions (VNFs) at different virtual machines (VMs) in a correct order. This can result in strong couplings between the decisions of the VMs on the placement and operations of VNFs. This paper presents a new fully decentralized online approach for optimal placement and operations of VNFs. Building on a new stochastic dual gradient method, our approach decouples the real-time decisions of VMs, asymptotically minimizes the time-average cost of NFV, and stabilizes the backlogs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07051","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:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibK6vpdd9rwzxv+LJkvKlbFWLHy6+t8+qpFnt5BNUGW2NuJWMAq6ggJe1lABKTNx+Dm2lHmWxhGU/CfTRiJpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:38:05.405470Z"},"content_sha256":"aa5f6740273fc8a10295995b56ced50edd1ca9caf706eef78f1e1d8c738e0e3f","schema_version":"1.0","event_id":"sha256:aa5f6740273fc8a10295995b56ced50edd1ca9caf706eef78f1e1d8c738e0e3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB/bundle.json","state_url":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4LXDVT43EAKDCK2S6GUC25XYB/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-01T10:38:05Z","links":{"resolver":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB","bundle":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB/bundle.json","state":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4LXDVT43EAKDCK2S6GUC25XYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:W4LXDVT43EAKDCK2S6GUC25XYB","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":"f0355a023d0389959e509e7b46723656e76e18ea5b529a885414fcb29e7a7b13","cross_cats_sorted":["cs.DC","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-19T09:27:03Z","title_canon_sha256":"19a467e43ec0ee4757890e8a0e113d2d103cccee3d43af9bcdeba9c377866e74"},"schema_version":"1.0","source":{"id":"1804.07051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07051","created_at":"2026-05-18T00:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07051v1","created_at":"2026-05-18T00:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07051","created_at":"2026-05-18T00:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"W4LXDVT43EAK","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W4LXDVT43EAKDCK2","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W4LXDVT4","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:aa5f6740273fc8a10295995b56ced50edd1ca9caf706eef78f1e1d8c738e0e3f","target":"graph","created_at":"2026-05-18T00:18:03Z","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":"Network Function Virtualization (NFV) can cost-efficiently provide network services by running different virtual network functions (VNFs) at different virtual machines (VMs) in a correct order. This can result in strong couplings between the decisions of the VMs on the placement and operations of VNFs. This paper presents a new fully decentralized online approach for optimal placement and operations of VNFs. Building on a new stochastic dual gradient method, our approach decouples the real-time decisions of VMs, asymptotically minimizes the time-average cost of NFV, and stabilizes the backlogs","authors_text":"Georgios B. Giannakis, Iain B. Collings, Ren Ping Liu, Tianyi Chen, Wei Ni, Xiaojing Chen, Xin Wang","cross_cats":["cs.DC","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-19T09:27:03Z","title":"Multi-Timescale Online Optimization of Network Function Virtualization for Service Chaining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07051","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:c6fceb3a0e0209c8b49d9573729c00da51168152ee9f82ca1bea3df46d338991","target":"record","created_at":"2026-05-18T00:18:03Z","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":"f0355a023d0389959e509e7b46723656e76e18ea5b529a885414fcb29e7a7b13","cross_cats_sorted":["cs.DC","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-19T09:27:03Z","title_canon_sha256":"19a467e43ec0ee4757890e8a0e113d2d103cccee3d43af9bcdeba9c377866e74"},"schema_version":"1.0","source":{"id":"1804.07051","kind":"arxiv","version":1}},"canonical_sha256":"b71771d67cd900a1895a978d416bb7c04bf44726c1acff25ad24373e20c86bd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b71771d67cd900a1895a978d416bb7c04bf44726c1acff25ad24373e20c86bd1","first_computed_at":"2026-05-18T00:18:03.572393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:03.572393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1dnUIUFP3BezTSqRaYu2ft8n9EYMQ+NTFrjLLF2YXxWFoWJguAcDqWK2FuAUjS6yuMoVuBG/p4RpUmZpNhPkDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:03.572931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6fceb3a0e0209c8b49d9573729c00da51168152ee9f82ca1bea3df46d338991","sha256:aa5f6740273fc8a10295995b56ced50edd1ca9caf706eef78f1e1d8c738e0e3f"],"state_sha256":"d9f5b702c74a821849866c1f051df8ce574c5a61a92e61ebe6c56f6c9a323463"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6GApFeMJtoRmWf3OOOvq/KXmFlQmz/PtQ7Dphzrme574YTfhiqaHvXK4+yhKnTDjmn7+vnzjvtDVjLpCRw6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:38:05.408373Z","bundle_sha256":"c42a343b50b564accabcb11e2158c302cbf0f4d85d8df0633c7f637603ed8b66"}}