{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YF44B2GZKAC77JCHAVZK4FZS5K","short_pith_number":"pith:YF44B2GZ","canonical_record":{"source":{"id":"1808.03031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-08-09T06:19:48Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"4e9e9872ac85d8b36509d86c0db8e61c6b698b7d4784d38c7c3c47cf150ac808","abstract_canon_sha256":"e328054da57351c26250b749c23110ab57701d2eef43f0bed54772c480e25ffe"},"schema_version":"1.0"},"canonical_sha256":"c179c0e8d95005ffa4470572ae1732eab83c2d4b91e950217dc7020407f78dc0","source":{"kind":"arxiv","id":"1808.03031","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03031","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03031v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03031","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"YF44B2GZKAC7","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YF44B2GZKAC77JCH","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YF44B2GZ","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YF44B2GZKAC77JCHAVZK4FZS5K","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-08-09T06:19:48Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"4e9e9872ac85d8b36509d86c0db8e61c6b698b7d4784d38c7c3c47cf150ac808","abstract_canon_sha256":"e328054da57351c26250b749c23110ab57701d2eef43f0bed54772c480e25ffe"},"schema_version":"1.0"},"canonical_sha256":"c179c0e8d95005ffa4470572ae1732eab83c2d4b91e950217dc7020407f78dc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:30.382381Z","signature_b64":"MteiFvJ+VtEP1zBjgAP3I2wLVZLN2iWQse43uL+xem+7fHZrnDmU6q/CJfXWMeKUNAKwjty+UudsgRfV6LkHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c179c0e8d95005ffa4470572ae1732eab83c2d4b91e950217dc7020407f78dc0","last_reissued_at":"2026-05-18T00:08:30.381964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:30.381964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03031","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-18T00:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YmI5HPaW5d8RWLURoHtWloNzkET1203+dfK/ORxvbr+xLsqNqkgkZJ2MeYyIZqdi5WugiEU0XFNr0+oF538LAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:26:49.246979Z"},"content_sha256":"27a8f9757023cdb8e6537f90af61a1e6b6683b4da88a09256b5568b52d10456a","schema_version":"1.0","event_id":"sha256:27a8f9757023cdb8e6537f90af61a1e6b6683b4da88a09256b5568b52d10456a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YF44B2GZKAC77JCHAVZK4FZS5K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constrained Shortest Path Scheme for Virtual Network Service Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.PF","authors_text":"Andrei Sukhov, Dmitrii Chemodanov, Flavio Esposito, Prasad Calyam","submitted_at":"2018-08-09T06:19:48Z","abstract_excerpt":"Virtual network services that span multiple data centers are important to support emerging data-intensive applications in fields such as bioinformatics and retail analytics. Successful virtual network service composition and maintenance requires flexible and scalable 'constrained shortest path management' both in the management plane for virtual network embedding (VNE) or network function virtualization service chaining (NFV-SC), as well as in the data plane for traffic engineering (TE). In this paper, we show analytically and empirically that leveraging constrained shortest paths within recen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03031","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-18T00:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltGXvzeXhh5VjATv5Ft3qigGNLEqHh5WKzVlrcrRSGeskP2V76fmrbeedxB3WTmHOyQFMlknepAogXLAiRkZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:26:49.247332Z"},"content_sha256":"25cbf3c5fda96e3f78ca4dbe9c510f90e02a756dae47eb8feca079a145713f79","schema_version":"1.0","event_id":"sha256:25cbf3c5fda96e3f78ca4dbe9c510f90e02a756dae47eb8feca079a145713f79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YF44B2GZKAC77JCHAVZK4FZS5K/bundle.json","state_url":"https://pith.science/pith/YF44B2GZKAC77JCHAVZK4FZS5K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YF44B2GZKAC77JCHAVZK4FZS5K/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-07-05T09:26:49Z","links":{"resolver":"https://pith.science/pith/YF44B2GZKAC77JCHAVZK4FZS5K","bundle":"https://pith.science/pith/YF44B2GZKAC77JCHAVZK4FZS5K/bundle.json","state":"https://pith.science/pith/YF44B2GZKAC77JCHAVZK4FZS5K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YF44B2GZKAC77JCHAVZK4FZS5K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YF44B2GZKAC77JCHAVZK4FZS5K","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":"e328054da57351c26250b749c23110ab57701d2eef43f0bed54772c480e25ffe","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-08-09T06:19:48Z","title_canon_sha256":"4e9e9872ac85d8b36509d86c0db8e61c6b698b7d4784d38c7c3c47cf150ac808"},"schema_version":"1.0","source":{"id":"1808.03031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03031","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03031v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03031","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"YF44B2GZKAC7","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YF44B2GZKAC77JCH","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YF44B2GZ","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:25cbf3c5fda96e3f78ca4dbe9c510f90e02a756dae47eb8feca079a145713f79","target":"graph","created_at":"2026-05-18T00:08:30Z","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":"Virtual network services that span multiple data centers are important to support emerging data-intensive applications in fields such as bioinformatics and retail analytics. Successful virtual network service composition and maintenance requires flexible and scalable 'constrained shortest path management' both in the management plane for virtual network embedding (VNE) or network function virtualization service chaining (NFV-SC), as well as in the data plane for traffic engineering (TE). In this paper, we show analytically and empirically that leveraging constrained shortest paths within recen","authors_text":"Andrei Sukhov, Dmitrii Chemodanov, Flavio Esposito, Prasad Calyam","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-08-09T06:19:48Z","title":"A Constrained Shortest Path Scheme for Virtual Network Service Management"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03031","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:27a8f9757023cdb8e6537f90af61a1e6b6683b4da88a09256b5568b52d10456a","target":"record","created_at":"2026-05-18T00:08:30Z","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":"e328054da57351c26250b749c23110ab57701d2eef43f0bed54772c480e25ffe","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-08-09T06:19:48Z","title_canon_sha256":"4e9e9872ac85d8b36509d86c0db8e61c6b698b7d4784d38c7c3c47cf150ac808"},"schema_version":"1.0","source":{"id":"1808.03031","kind":"arxiv","version":1}},"canonical_sha256":"c179c0e8d95005ffa4470572ae1732eab83c2d4b91e950217dc7020407f78dc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c179c0e8d95005ffa4470572ae1732eab83c2d4b91e950217dc7020407f78dc0","first_computed_at":"2026-05-18T00:08:30.381964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:30.381964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MteiFvJ+VtEP1zBjgAP3I2wLVZLN2iWQse43uL+xem+7fHZrnDmU6q/CJfXWMeKUNAKwjty+UudsgRfV6LkHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:30.382381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27a8f9757023cdb8e6537f90af61a1e6b6683b4da88a09256b5568b52d10456a","sha256:25cbf3c5fda96e3f78ca4dbe9c510f90e02a756dae47eb8feca079a145713f79"],"state_sha256":"ca59bec7e9953051e1cf771c145ac5d24f9e5eb959a495e594e92936a1c1c159"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LkxTx1PruNbE53H8dPPOQoT+3Hnx1VujwvuPlVROjNgtmxl4RgtHV96KD3T/rStH4IP++IxF4oro9NmsJwgzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:26:49.249164Z","bundle_sha256":"d32f78c62e4e3ee34df8bb0a7ddf0dc57f923aba06332ea9a3e0db5876af94cd"}}