{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5PELUGOML3MRYPZ6DS4W4LFLDG","short_pith_number":"pith:5PELUGOM","schema_version":"1.0","canonical_sha256":"ebc8ba19cc5ed91c3f3e1cb96e2cab19aaf682071af29bb3df3ec55105457573","source":{"kind":"arxiv","id":"1803.04452","version":1},"attestation_state":"computed","paper":{"title":"(FPT-)Approximation Algorithms for the Virtual Network Embedding Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Matthias Rost, Stefan Schmid","submitted_at":"2018-03-12T18:44:46Z","abstract_excerpt":"Many resource allocation problems in the cloud can be described as a basic Virtual Network Embedding Problem (VNEP): finding mappings of request graphs (describing the workloads) onto a substrate graph (describing the physical infrastructure). In the offline setting, the two natural objectives are profit maximization, i.e., embedding a maximal number of request graphs subject to the resource constraints, and cost minimization, i.e., embedding all requests at minimal overall cost. The VNEP can be seen as a generalization of classic routing and call admission problems, in which requests are arbi"},"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":"1803.04452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-03-12T18:44:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"585ac868863f9c9a6fcb69c0da93a97e28b461a291b4f7d435d515589df499fb","abstract_canon_sha256":"163ee0a2651c2002d444ac81f9a6a0a21d59d47855983984722fedfff218a7e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:19.007128Z","signature_b64":"qeB4fyxRjj9Mbkqyhw/HqtTNyhTpyRRPUDurxZoWbTUa2XAW4EMp40T2jWm8vsYl3PEFty1xJmL17NgKKMnVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebc8ba19cc5ed91c3f3e1cb96e2cab19aaf682071af29bb3df3ec55105457573","last_reissued_at":"2026-05-18T00:21:19.006722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:19.006722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"(FPT-)Approximation Algorithms for the Virtual Network Embedding Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Matthias Rost, Stefan Schmid","submitted_at":"2018-03-12T18:44:46Z","abstract_excerpt":"Many resource allocation problems in the cloud can be described as a basic Virtual Network Embedding Problem (VNEP): finding mappings of request graphs (describing the workloads) onto a substrate graph (describing the physical infrastructure). In the offline setting, the two natural objectives are profit maximization, i.e., embedding a maximal number of request graphs subject to the resource constraints, and cost minimization, i.e., embedding all requests at minimal overall cost. The VNEP can be seen as a generalization of classic routing and call admission problems, in which requests are arbi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04452","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":"1803.04452","created_at":"2026-05-18T00:21:19.006776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04452v1","created_at":"2026-05-18T00:21:19.006776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04452","created_at":"2026-05-18T00:21:19.006776+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PELUGOML3MR","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PELUGOML3MRYPZ6","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PELUGOM","created_at":"2026-05-18T12:32:08.215937+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/5PELUGOML3MRYPZ6DS4W4LFLDG","json":"https://pith.science/pith/5PELUGOML3MRYPZ6DS4W4LFLDG.json","graph_json":"https://pith.science/api/pith-number/5PELUGOML3MRYPZ6DS4W4LFLDG/graph.json","events_json":"https://pith.science/api/pith-number/5PELUGOML3MRYPZ6DS4W4LFLDG/events.json","paper":"https://pith.science/paper/5PELUGOM"},"agent_actions":{"view_html":"https://pith.science/pith/5PELUGOML3MRYPZ6DS4W4LFLDG","download_json":"https://pith.science/pith/5PELUGOML3MRYPZ6DS4W4LFLDG.json","view_paper":"https://pith.science/paper/5PELUGOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04452&json=true","fetch_graph":"https://pith.science/api/pith-number/5PELUGOML3MRYPZ6DS4W4LFLDG/graph.json","fetch_events":"https://pith.science/api/pith-number/5PELUGOML3MRYPZ6DS4W4LFLDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PELUGOML3MRYPZ6DS4W4LFLDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PELUGOML3MRYPZ6DS4W4LFLDG/action/storage_attestation","attest_author":"https://pith.science/pith/5PELUGOML3MRYPZ6DS4W4LFLDG/action/author_attestation","sign_citation":"https://pith.science/pith/5PELUGOML3MRYPZ6DS4W4LFLDG/action/citation_signature","submit_replication":"https://pith.science/pith/5PELUGOML3MRYPZ6DS4W4LFLDG/action/replication_record"}},"created_at":"2026-05-18T00:21:19.006776+00:00","updated_at":"2026-05-18T00:21:19.006776+00:00"}