{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2UFKKIO3EBCLWF5I3UHHTHYSYV","short_pith_number":"pith:2UFKKIO3","canonical_record":{"source":{"id":"1103.0966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-04T19:51:41Z","cross_cats_sorted":[],"title_canon_sha256":"d8065e4ed9b21e910e4657e715a18d6a924d22d678c7dd669a72089b6cc74073","abstract_canon_sha256":"3f2eed0ddc4a9f8573e8e7c10bcffe0556cb7d761ff2ac5fd77932ec61556bc3"},"schema_version":"1.0"},"canonical_sha256":"d50aa521db2044bb17a8dd0e799f12c5755a093d7c348e30da1d3faebbeacfba","source":{"kind":"arxiv","id":"1103.0966","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0966","created_at":"2026-05-18T04:27:25Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0966v1","created_at":"2026-05-18T04:27:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0966","created_at":"2026-05-18T04:27:25Z"},{"alias_kind":"pith_short_12","alias_value":"2UFKKIO3EBCL","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2UFKKIO3EBCLWF5I","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2UFKKIO3","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2UFKKIO3EBCLWF5I3UHHTHYSYV","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-04T19:51:41Z","cross_cats_sorted":[],"title_canon_sha256":"d8065e4ed9b21e910e4657e715a18d6a924d22d678c7dd669a72089b6cc74073","abstract_canon_sha256":"3f2eed0ddc4a9f8573e8e7c10bcffe0556cb7d761ff2ac5fd77932ec61556bc3"},"schema_version":"1.0"},"canonical_sha256":"d50aa521db2044bb17a8dd0e799f12c5755a093d7c348e30da1d3faebbeacfba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:25.952421Z","signature_b64":"YVLY0yIZRW8dvO6I/rpnJbA6VbXH7cHDgLA+4mRcKdeCHD7y/VOeOb5eInAtRcThCZwJ+B6A30cQvFiAAwlrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d50aa521db2044bb17a8dd0e799f12c5755a093d7c348e30da1d3faebbeacfba","last_reissued_at":"2026-05-18T04:27:25.951715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:25.951715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0966","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-18T04:27:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VzK/QRVVa1WC9QixW1a2Fm5jYULl1MEnWpQGZ9lKzvTjn4cUXgbIoqMNAW74Hc02Yo+Ycb/1KfkS9DMdAPQhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:54:10.138188Z"},"content_sha256":"af3afbf611ef2ff82ae7cfcb9a663af8266d5a5c7491c1a8b506ff068ea98870","schema_version":"1.0","event_id":"sha256:af3afbf611ef2ff82ae7cfcb9a663af8266d5a5c7491c1a8b506ff068ea98870"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2UFKKIO3EBCLWF5I3UHHTHYSYV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anja Feldmann, Dushyant Arora, Gregor Schaffrath, Marcin Bienkowski, Stefan Schmid","submitted_at":"2011-03-04T19:51:41Z","abstract_excerpt":"Network virtualization allows one to build dynamic distributed systems in which resources can be dynamically allocated at locations where they are most useful. In order to fully exploit the benefits of this new technology, protocols need to be devised which react efficiently to changes in the demand. This paper argues that the field of online algorithms and competitive analysis provides useful tools to deal with and reason about the uncertainty in the request dynamics, and to design algorithms with provable performance guarantees. As a case study, we describe a system (e.g., a gaming applicati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0966","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-18T04:27:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dw34dmDZ52nChk+jRydM6eSMLls+3rtLYjw8hL1UCGO9uZhgLB2LVUwTqpzY7/eZssN0IL+vcneh7V30EBv0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:54:10.138931Z"},"content_sha256":"4637a3f6447f195f86606e0640a878a4999bb009224726633cfced9cd6202f2a","schema_version":"1.0","event_id":"sha256:4637a3f6447f195f86606e0640a878a4999bb009224726633cfced9cd6202f2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UFKKIO3EBCLWF5I3UHHTHYSYV/bundle.json","state_url":"https://pith.science/pith/2UFKKIO3EBCLWF5I3UHHTHYSYV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UFKKIO3EBCLWF5I3UHHTHYSYV/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-05-27T11:54:10Z","links":{"resolver":"https://pith.science/pith/2UFKKIO3EBCLWF5I3UHHTHYSYV","bundle":"https://pith.science/pith/2UFKKIO3EBCLWF5I3UHHTHYSYV/bundle.json","state":"https://pith.science/pith/2UFKKIO3EBCLWF5I3UHHTHYSYV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UFKKIO3EBCLWF5I3UHHTHYSYV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2UFKKIO3EBCLWF5I3UHHTHYSYV","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":"3f2eed0ddc4a9f8573e8e7c10bcffe0556cb7d761ff2ac5fd77932ec61556bc3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-04T19:51:41Z","title_canon_sha256":"d8065e4ed9b21e910e4657e715a18d6a924d22d678c7dd669a72089b6cc74073"},"schema_version":"1.0","source":{"id":"1103.0966","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0966","created_at":"2026-05-18T04:27:25Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0966v1","created_at":"2026-05-18T04:27:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0966","created_at":"2026-05-18T04:27:25Z"},{"alias_kind":"pith_short_12","alias_value":"2UFKKIO3EBCL","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2UFKKIO3EBCLWF5I","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2UFKKIO3","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:4637a3f6447f195f86606e0640a878a4999bb009224726633cfced9cd6202f2a","target":"graph","created_at":"2026-05-18T04:27:25Z","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 virtualization allows one to build dynamic distributed systems in which resources can be dynamically allocated at locations where they are most useful. In order to fully exploit the benefits of this new technology, protocols need to be devised which react efficiently to changes in the demand. This paper argues that the field of online algorithms and competitive analysis provides useful tools to deal with and reason about the uncertainty in the request dynamics, and to design algorithms with provable performance guarantees. As a case study, we describe a system (e.g., a gaming applicati","authors_text":"Anja Feldmann, Dushyant Arora, Gregor Schaffrath, Marcin Bienkowski, Stefan Schmid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-04T19:51:41Z","title":"Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0966","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:af3afbf611ef2ff82ae7cfcb9a663af8266d5a5c7491c1a8b506ff068ea98870","target":"record","created_at":"2026-05-18T04:27:25Z","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":"3f2eed0ddc4a9f8573e8e7c10bcffe0556cb7d761ff2ac5fd77932ec61556bc3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-04T19:51:41Z","title_canon_sha256":"d8065e4ed9b21e910e4657e715a18d6a924d22d678c7dd669a72089b6cc74073"},"schema_version":"1.0","source":{"id":"1103.0966","kind":"arxiv","version":1}},"canonical_sha256":"d50aa521db2044bb17a8dd0e799f12c5755a093d7c348e30da1d3faebbeacfba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d50aa521db2044bb17a8dd0e799f12c5755a093d7c348e30da1d3faebbeacfba","first_computed_at":"2026-05-18T04:27:25.951715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:25.951715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YVLY0yIZRW8dvO6I/rpnJbA6VbXH7cHDgLA+4mRcKdeCHD7y/VOeOb5eInAtRcThCZwJ+B6A30cQvFiAAwlrDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:25.952421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0966","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af3afbf611ef2ff82ae7cfcb9a663af8266d5a5c7491c1a8b506ff068ea98870","sha256:4637a3f6447f195f86606e0640a878a4999bb009224726633cfced9cd6202f2a"],"state_sha256":"39fcfb055d70524d51fc6dd091aee6d131337d671dc6c37d3071398e1d4173e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3LaJ/AHrwcBw21N8KaOIEJWr69+Zr5dWJVnARluOdJGniAT4LHFN0GE08brW8GpyPgQMC18pMO3Tj6APmyJaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:54:10.142626Z","bundle_sha256":"d28bfbd096ff474dca14504275dfa1a5e12f0be09f43e5c40a01294dfcc9339e"}}