{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DGMUGJUGHG2ALESAYHNXTBF2ZG","short_pith_number":"pith:DGMUGJUG","schema_version":"1.0","canonical_sha256":"199943268639b4059240c1db7984bac9b726fd9abf5937e226bde97cb2627080","source":{"kind":"arxiv","id":"1501.07887","version":1},"attestation_state":"computed","paper":{"title":"Optimal offline virtual network embedding with rent-at-bulk aspects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arie M.C.A. Koster, Axel Werner, Boris Grimm, Martin Tieves, Stefano Coniglio","submitted_at":"2015-01-30T19:32:31Z","abstract_excerpt":"Network virtualization techniques allow for the coexistence of many virtual networks (VNs) jointly sharing the resources of an underlying substrate network. The Virtual Network Embedding problem (VNE) arises when looking for the most profitable set of VNs to embed onto the substrate. In this paper, we address the offline version of the problem. We propose a Mixed-Integer Linear Programming formulation to solve it to optimality which accounts for acceptance and rejection of virtual network requests, allowing for both splittable and unsplittable (single path) routing schemes. Our formulation als"},"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":"1501.07887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-30T19:32:31Z","cross_cats_sorted":[],"title_canon_sha256":"fa153590e9d5bd9414626e8e49a44bc14b0bbfb61fa2218c0e8be012ad768044","abstract_canon_sha256":"d30f46e0ce51eddf56a78120c094c14b6e35e7ba73354d2a19c4e0c4063e918a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:13.835202Z","signature_b64":"nmTKnwPTVKnjmIT/eB1w/PUOxXSVUSygzFpgLIW7CwhuckJNhOK41AlH83D+LtKw3M0y/FckvEUw3FrrE8VGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"199943268639b4059240c1db7984bac9b726fd9abf5937e226bde97cb2627080","last_reissued_at":"2026-05-18T02:28:13.834528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:13.834528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal offline virtual network embedding with rent-at-bulk aspects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arie M.C.A. Koster, Axel Werner, Boris Grimm, Martin Tieves, Stefano Coniglio","submitted_at":"2015-01-30T19:32:31Z","abstract_excerpt":"Network virtualization techniques allow for the coexistence of many virtual networks (VNs) jointly sharing the resources of an underlying substrate network. The Virtual Network Embedding problem (VNE) arises when looking for the most profitable set of VNs to embed onto the substrate. In this paper, we address the offline version of the problem. We propose a Mixed-Integer Linear Programming formulation to solve it to optimality which accounts for acceptance and rejection of virtual network requests, allowing for both splittable and unsplittable (single path) routing schemes. Our formulation als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07887","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":"1501.07887","created_at":"2026-05-18T02:28:13.834633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07887v1","created_at":"2026-05-18T02:28:13.834633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07887","created_at":"2026-05-18T02:28:13.834633+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGMUGJUGHG2A","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGMUGJUGHG2ALESA","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGMUGJUG","created_at":"2026-05-18T12:29:17.054201+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/DGMUGJUGHG2ALESAYHNXTBF2ZG","json":"https://pith.science/pith/DGMUGJUGHG2ALESAYHNXTBF2ZG.json","graph_json":"https://pith.science/api/pith-number/DGMUGJUGHG2ALESAYHNXTBF2ZG/graph.json","events_json":"https://pith.science/api/pith-number/DGMUGJUGHG2ALESAYHNXTBF2ZG/events.json","paper":"https://pith.science/paper/DGMUGJUG"},"agent_actions":{"view_html":"https://pith.science/pith/DGMUGJUGHG2ALESAYHNXTBF2ZG","download_json":"https://pith.science/pith/DGMUGJUGHG2ALESAYHNXTBF2ZG.json","view_paper":"https://pith.science/paper/DGMUGJUG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07887&json=true","fetch_graph":"https://pith.science/api/pith-number/DGMUGJUGHG2ALESAYHNXTBF2ZG/graph.json","fetch_events":"https://pith.science/api/pith-number/DGMUGJUGHG2ALESAYHNXTBF2ZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGMUGJUGHG2ALESAYHNXTBF2ZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGMUGJUGHG2ALESAYHNXTBF2ZG/action/storage_attestation","attest_author":"https://pith.science/pith/DGMUGJUGHG2ALESAYHNXTBF2ZG/action/author_attestation","sign_citation":"https://pith.science/pith/DGMUGJUGHG2ALESAYHNXTBF2ZG/action/citation_signature","submit_replication":"https://pith.science/pith/DGMUGJUGHG2ALESAYHNXTBF2ZG/action/replication_record"}},"created_at":"2026-05-18T02:28:13.834633+00:00","updated_at":"2026-05-18T02:28:13.834633+00:00"}