{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YDHRGAES4QLP77ZTDEM33TWV7K","short_pith_number":"pith:YDHRGAES","canonical_record":{"source":{"id":"1610.04260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-15T11:30:42Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"24f333454fc13a86d229e292d2d08ace660c699ba0450f5a6bc1357e420155d6","abstract_canon_sha256":"fbc0fc267dd3d2211f4ffe5c88bc74471e3f4d7d9476260695abdfdef1b91cb1"},"schema_version":"1.0"},"canonical_sha256":"c0cf130092e416ffff331919bdced5fa9dde94fdeff026bbdcc4e7d9b27eaed8","source":{"kind":"arxiv","id":"1610.04260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04260","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04260v1","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04260","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"YDHRGAES4QLP","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YDHRGAES4QLP77ZT","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YDHRGAES","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YDHRGAES4QLP77ZTDEM33TWV7K","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-15T11:30:42Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"24f333454fc13a86d229e292d2d08ace660c699ba0450f5a6bc1357e420155d6","abstract_canon_sha256":"fbc0fc267dd3d2211f4ffe5c88bc74471e3f4d7d9476260695abdfdef1b91cb1"},"schema_version":"1.0"},"canonical_sha256":"c0cf130092e416ffff331919bdced5fa9dde94fdeff026bbdcc4e7d9b27eaed8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:20.203375Z","signature_b64":"MIKbRv4UY7JO/Xb7Z/vP6i+T/WEYE9G+YCAaEicXIW15XUjBXqfsVLrsZegkhz962fXROzcUhZVhVlm0MvIEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0cf130092e416ffff331919bdced5fa9dde94fdeff026bbdcc4e7d9b27eaed8","last_reissued_at":"2026-05-18T01:02:20.202772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:20.202772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04260","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-18T01:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gusMKJMTh8teFDG7pcLVaYaMHK2SDrQSxO0yvfwHwE82Z3Q0sLzuvQIMj9v+9j3JKseclr8nsQGFriYHIB5lAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:32:23.782942Z"},"content_sha256":"7df9dcdfb18da56f19411965778dcc8c2bbc8398012c40bc8cce2d2d168008ac","schema_version":"1.0","event_id":"sha256:7df9dcdfb18da56f19411965778dcc8c2bbc8398012c40bc8cce2d2d168008ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YDHRGAES4QLP77ZTDEM33TWV7K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cost minimization of network services with buffer and end-to-end deadline constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Enrico Bini, Johan Eker, Victor Millnert","submitted_at":"2016-09-15T11:30:42Z","abstract_excerpt":"Cloud computing technology provides the means to share physical resources among multiple users and data center tenants by exposing them as virtual resources. There is a strong industrial drive to use similar technology and concepts to provide timing sensitive services. One such is virtual networking services, so called services chains, which consist of several interconnected virtual network functions. This allows for the capacity to be scaled up and down by adding or removing virtual resources. In this work, we develop a model of a service chain and pose the dynamic allocation of resources as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04260","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-18T01:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r7Qw2H6lnYHDXsAeprVZWr6FkJG9SIxbydvOBFRq7ll85oS7VFH54zYRdmrnHFQKrqkEHC0Pb/8n6EXUg8yeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:32:23.783294Z"},"content_sha256":"37f059d68f1f049274d07cd538133995834b8123805d7e4196ff47c5fdca351e","schema_version":"1.0","event_id":"sha256:37f059d68f1f049274d07cd538133995834b8123805d7e4196ff47c5fdca351e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDHRGAES4QLP77ZTDEM33TWV7K/bundle.json","state_url":"https://pith.science/pith/YDHRGAES4QLP77ZTDEM33TWV7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDHRGAES4QLP77ZTDEM33TWV7K/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-26T15:32:23Z","links":{"resolver":"https://pith.science/pith/YDHRGAES4QLP77ZTDEM33TWV7K","bundle":"https://pith.science/pith/YDHRGAES4QLP77ZTDEM33TWV7K/bundle.json","state":"https://pith.science/pith/YDHRGAES4QLP77ZTDEM33TWV7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDHRGAES4QLP77ZTDEM33TWV7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YDHRGAES4QLP77ZTDEM33TWV7K","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":"fbc0fc267dd3d2211f4ffe5c88bc74471e3f4d7d9476260695abdfdef1b91cb1","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-15T11:30:42Z","title_canon_sha256":"24f333454fc13a86d229e292d2d08ace660c699ba0450f5a6bc1357e420155d6"},"schema_version":"1.0","source":{"id":"1610.04260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04260","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04260v1","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04260","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"YDHRGAES4QLP","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YDHRGAES4QLP77ZT","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YDHRGAES","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:37f059d68f1f049274d07cd538133995834b8123805d7e4196ff47c5fdca351e","target":"graph","created_at":"2026-05-18T01:02:20Z","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":"Cloud computing technology provides the means to share physical resources among multiple users and data center tenants by exposing them as virtual resources. There is a strong industrial drive to use similar technology and concepts to provide timing sensitive services. One such is virtual networking services, so called services chains, which consist of several interconnected virtual network functions. This allows for the capacity to be scaled up and down by adding or removing virtual resources. In this work, we develop a model of a service chain and pose the dynamic allocation of resources as ","authors_text":"Enrico Bini, Johan Eker, Victor Millnert","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-15T11:30:42Z","title":"Cost minimization of network services with buffer and end-to-end deadline constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04260","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:7df9dcdfb18da56f19411965778dcc8c2bbc8398012c40bc8cce2d2d168008ac","target":"record","created_at":"2026-05-18T01:02:20Z","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":"fbc0fc267dd3d2211f4ffe5c88bc74471e3f4d7d9476260695abdfdef1b91cb1","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-15T11:30:42Z","title_canon_sha256":"24f333454fc13a86d229e292d2d08ace660c699ba0450f5a6bc1357e420155d6"},"schema_version":"1.0","source":{"id":"1610.04260","kind":"arxiv","version":1}},"canonical_sha256":"c0cf130092e416ffff331919bdced5fa9dde94fdeff026bbdcc4e7d9b27eaed8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0cf130092e416ffff331919bdced5fa9dde94fdeff026bbdcc4e7d9b27eaed8","first_computed_at":"2026-05-18T01:02:20.202772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:20.202772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MIKbRv4UY7JO/Xb7Z/vP6i+T/WEYE9G+YCAaEicXIW15XUjBXqfsVLrsZegkhz962fXROzcUhZVhVlm0MvIEBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:20.203375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7df9dcdfb18da56f19411965778dcc8c2bbc8398012c40bc8cce2d2d168008ac","sha256:37f059d68f1f049274d07cd538133995834b8123805d7e4196ff47c5fdca351e"],"state_sha256":"f5fe10cf5309f5b2059e4db663596c230a9db4440becd989f380d3d46627c6f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOJ8+4ytsdn1sgf6AVQ7ZdAPZ2rrZ1rnmwhyM6BZSMK4DFrCwkVMEIcCXGZSSLzYp+looEgb0yt5E4OaHFp7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T15:32:23.785244Z","bundle_sha256":"c0d6f931f8ec75d56d2fd3e5b51c53c6f9477887808df3823990a290b6223ebd"}}