{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W4LXDVT43EAKDCK2S6GUC25XYB","short_pith_number":"pith:W4LXDVT4","schema_version":"1.0","canonical_sha256":"b71771d67cd900a1895a978d416bb7c04bf44726c1acff25ad24373e20c86bd1","source":{"kind":"arxiv","id":"1804.07051","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.07051","created_at":"2026-05-18T00:18:03.572489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07051v1","created_at":"2026-05-18T00:18:03.572489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07051","created_at":"2026-05-18T00:18:03.572489+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4LXDVT43EAK","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4LXDVT43EAKDCK2","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4LXDVT4","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB","json":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB.json","graph_json":"https://pith.science/api/pith-number/W4LXDVT43EAKDCK2S6GUC25XYB/graph.json","events_json":"https://pith.science/api/pith-number/W4LXDVT43EAKDCK2S6GUC25XYB/events.json","paper":"https://pith.science/paper/W4LXDVT4"},"agent_actions":{"view_html":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB","download_json":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB.json","view_paper":"https://pith.science/paper/W4LXDVT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07051&json=true","fetch_graph":"https://pith.science/api/pith-number/W4LXDVT43EAKDCK2S6GUC25XYB/graph.json","fetch_events":"https://pith.science/api/pith-number/W4LXDVT43EAKDCK2S6GUC25XYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB/action/storage_attestation","attest_author":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB/action/author_attestation","sign_citation":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB/action/citation_signature","submit_replication":"https://pith.science/pith/W4LXDVT43EAKDCK2S6GUC25XYB/action/replication_record"}},"created_at":"2026-05-18T00:18:03.572489+00:00","updated_at":"2026-05-18T00:18:03.572489+00:00"}