{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:X6LZFN2MSSMGKKNJOYVYIX2KTO","short_pith_number":"pith:X6LZFN2M","canonical_record":{"source":{"id":"1604.08274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-28T00:26:58Z","cross_cats_sorted":[],"title_canon_sha256":"44ef496c30311a15f67211c8965f5505e444180855847f7d8df464f67ab48b76","abstract_canon_sha256":"f332a306cf71e6da51d12dbb9003d3c8325964eceeb55d93e83f47a9c83c022d"},"schema_version":"1.0"},"canonical_sha256":"bf9792b74c94986529a9762b845f4a9ba2ee3af233d2e22b810dcd41a82855bc","source":{"kind":"arxiv","id":"1604.08274","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08274","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08274v1","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08274","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"X6LZFN2MSSMG","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X6LZFN2MSSMGKKNJ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X6LZFN2M","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:X6LZFN2MSSMGKKNJOYVYIX2KTO","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-28T00:26:58Z","cross_cats_sorted":[],"title_canon_sha256":"44ef496c30311a15f67211c8965f5505e444180855847f7d8df464f67ab48b76","abstract_canon_sha256":"f332a306cf71e6da51d12dbb9003d3c8325964eceeb55d93e83f47a9c83c022d"},"schema_version":"1.0"},"canonical_sha256":"bf9792b74c94986529a9762b845f4a9ba2ee3af233d2e22b810dcd41a82855bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:56.932156Z","signature_b64":"/9ky34rUwZVMYF2TLDOwqTjV1EmODH/b9goMjxtCZMqBkjFjngd4oN4AIX0swrggJz2ABukX38wAldwoflT7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf9792b74c94986529a9762b845f4a9ba2ee3af233d2e22b810dcd41a82855bc","last_reissued_at":"2026-05-18T00:58:56.931430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:56.931430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08274","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:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1uZSSVTtzD2s16NMBaMvdoqm+MzMnu/oSlrXIZdrj7QC91Y8ZhP/M8i3VmA/V9em3BLDk+L7Ny4SzF5R0EKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:06:53.797747Z"},"content_sha256":"5d5c7f171efe1d5084e36cb4505984279df4533303f3fa595130391388c8d723","schema_version":"1.0","event_id":"sha256:5d5c7f171efe1d5084e36cb4505984279df4533303f3fa595130391388c8d723"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:X6LZFN2MSSMGKKNJOYVYIX2KTO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Constrained Shortest Path Approach for Virtual Path Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Andrei Sukhov, Dmitrii Chemodanov, Flavio Esposito, Prasad Calyam","submitted_at":"2016-04-28T00:26:58Z","abstract_excerpt":"Network virtualization has become a fundamental technology to deliver services for emerging data-intensive applications in fields such as bioinformatics and retail analytics hosted at multi-data center scales. To create and maintain a successful virtual network service, the problem of generating a constrained path manifests both in the management plane with a physical path creation (chains of virtual network functions or virtual link embedding) and in the data plane with on-demand path adaptation (traffic steering with Service Level Objective (SLO) guarantees). In this paper, we define the vir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08274","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:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tlmg1WXFscNOSy0QaSJooLS3Xq2C1/e5u0bwx6nNZ5odlqWISnNF7jZfiDEbWtPuQKsPqV6GY8aY68CMnk8oAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:06:53.798373Z"},"content_sha256":"3c1f3b5c1e561d9cd3cf05dc5406cecddb415c5e1ce604cf47b77fec6500aea7","schema_version":"1.0","event_id":"sha256:3c1f3b5c1e561d9cd3cf05dc5406cecddb415c5e1ce604cf47b77fec6500aea7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6LZFN2MSSMGKKNJOYVYIX2KTO/bundle.json","state_url":"https://pith.science/pith/X6LZFN2MSSMGKKNJOYVYIX2KTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6LZFN2MSSMGKKNJOYVYIX2KTO/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-05T14:06:53Z","links":{"resolver":"https://pith.science/pith/X6LZFN2MSSMGKKNJOYVYIX2KTO","bundle":"https://pith.science/pith/X6LZFN2MSSMGKKNJOYVYIX2KTO/bundle.json","state":"https://pith.science/pith/X6LZFN2MSSMGKKNJOYVYIX2KTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6LZFN2MSSMGKKNJOYVYIX2KTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X6LZFN2MSSMGKKNJOYVYIX2KTO","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":"f332a306cf71e6da51d12dbb9003d3c8325964eceeb55d93e83f47a9c83c022d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-28T00:26:58Z","title_canon_sha256":"44ef496c30311a15f67211c8965f5505e444180855847f7d8df464f67ab48b76"},"schema_version":"1.0","source":{"id":"1604.08274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08274","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08274v1","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08274","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"X6LZFN2MSSMG","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X6LZFN2MSSMGKKNJ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X6LZFN2M","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:3c1f3b5c1e561d9cd3cf05dc5406cecddb415c5e1ce604cf47b77fec6500aea7","target":"graph","created_at":"2026-05-18T00:58:56Z","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 has become a fundamental technology to deliver services for emerging data-intensive applications in fields such as bioinformatics and retail analytics hosted at multi-data center scales. To create and maintain a successful virtual network service, the problem of generating a constrained path manifests both in the management plane with a physical path creation (chains of virtual network functions or virtual link embedding) and in the data plane with on-demand path adaptation (traffic steering with Service Level Objective (SLO) guarantees). In this paper, we define the vir","authors_text":"Andrei Sukhov, Dmitrii Chemodanov, Flavio Esposito, Prasad Calyam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-28T00:26:58Z","title":"A General Constrained Shortest Path Approach for Virtual Path Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08274","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:5d5c7f171efe1d5084e36cb4505984279df4533303f3fa595130391388c8d723","target":"record","created_at":"2026-05-18T00:58:56Z","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":"f332a306cf71e6da51d12dbb9003d3c8325964eceeb55d93e83f47a9c83c022d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-28T00:26:58Z","title_canon_sha256":"44ef496c30311a15f67211c8965f5505e444180855847f7d8df464f67ab48b76"},"schema_version":"1.0","source":{"id":"1604.08274","kind":"arxiv","version":1}},"canonical_sha256":"bf9792b74c94986529a9762b845f4a9ba2ee3af233d2e22b810dcd41a82855bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf9792b74c94986529a9762b845f4a9ba2ee3af233d2e22b810dcd41a82855bc","first_computed_at":"2026-05-18T00:58:56.931430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:56.931430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/9ky34rUwZVMYF2TLDOwqTjV1EmODH/b9goMjxtCZMqBkjFjngd4oN4AIX0swrggJz2ABukX38wAldwoflT7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:56.932156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d5c7f171efe1d5084e36cb4505984279df4533303f3fa595130391388c8d723","sha256:3c1f3b5c1e561d9cd3cf05dc5406cecddb415c5e1ce604cf47b77fec6500aea7"],"state_sha256":"65ae0d10e493e48b8f05d39482489dda7b809889e42423734f9facc22ffdb86c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v3L3BvwJKHcb4HFLIj+oUej2mxF2oNTGzR5+0T/mumSnCbEl8iDjL6U3MWK2QYJKg3nnfaWc1vKiXNpjqaWDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:06:53.802002Z","bundle_sha256":"fe68d6b472669b0f3d0471e1aa37c841b5f1e339ca91608503b139fd1b2ce64e"}}