{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4MT2KOIOVZCESIICCA7LUHZUDP","short_pith_number":"pith:4MT2KOIO","canonical_record":{"source":{"id":"1608.00095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-07-30T09:04:25Z","cross_cats_sorted":[],"title_canon_sha256":"8d02e7e0bfe83b0819f6c25994a8b11feb5d05c1b84e5b64d9551944ca88897f","abstract_canon_sha256":"a778064d857f7ec78f1018c46be5c632682419073c0e70d39ce4f8a7c09aa89e"},"schema_version":"1.0"},"canonical_sha256":"e327a5390eae44492102103eba1f341bc85168e67293b1327c8ea072208b8294","source":{"kind":"arxiv","id":"1608.00095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00095","created_at":"2026-05-18T01:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00095v1","created_at":"2026-05-18T01:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00095","created_at":"2026-05-18T01:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"4MT2KOIOVZCE","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4MT2KOIOVZCESIIC","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4MT2KOIO","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4MT2KOIOVZCESIICCA7LUHZUDP","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-07-30T09:04:25Z","cross_cats_sorted":[],"title_canon_sha256":"8d02e7e0bfe83b0819f6c25994a8b11feb5d05c1b84e5b64d9551944ca88897f","abstract_canon_sha256":"a778064d857f7ec78f1018c46be5c632682419073c0e70d39ce4f8a7c09aa89e"},"schema_version":"1.0"},"canonical_sha256":"e327a5390eae44492102103eba1f341bc85168e67293b1327c8ea072208b8294","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:13.826650Z","signature_b64":"wtN+CNeurY8NxuqI9k67tatAcJVJzGS1336LXibdfzYDilXD9l2lAYDXsFSlsUeM5dfMJKVwsFod+q8XoQqCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e327a5390eae44492102103eba1f341bc85168e67293b1327c8ea072208b8294","last_reissued_at":"2026-05-18T01:10:13.826207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:13.826207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00095","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:10:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pzi2BQq4UrFqrZRMX2T7n2hVOQ370o+hJG1hPJh5kcxkMkQTNkS+3akqxEDnxcfmDw/an68686nqhjKGd7sPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:28:51.742781Z"},"content_sha256":"f487cdf7719d5c914ae910e94a05e59c403838ef9c0518188050bbd56f74f1de","schema_version":"1.0","event_id":"sha256:f487cdf7719d5c914ae910e94a05e59c403838ef9c0518188050bbd56f74f1de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4MT2KOIOVZCESIICCA7LUHZUDP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Service Function Chaining Resource Allocation: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Sheng Wang, Yanghao Xie, Yuxiu Wang, Zhixiang Liu","submitted_at":"2016-07-30T09:04:25Z","abstract_excerpt":"Service Function Chaining (SFC) is a crucial technology for future Internet. It aims to overcome the limitation of current deployment models which is rigid and static. Application of this technology relies on algorithms that can optimally mapping SFC to substrate network. This category of algorithms is referred as \"Service Function Chaining Resource Allocation (SFC-RA)\" algorithms or \"VNF placement (VNFP)\" algorithms. This paper presents a survey of current researches in SFC-RA algorithms. After presenting the formulation and related problems, several variants of SFC-RA problem are summarized."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00095","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:10:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"La0iOvyj8XBe4ue9THI3cX2Mf08HZol2roAFConEz56lHoLz90SO/PzBDZ0c3LWSnpyOoxdVGHDOhIllvGV/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:28:51.743128Z"},"content_sha256":"1caad06726d22e15968be10f791187b14dec33e5e2fd778d565218c16f0ad269","schema_version":"1.0","event_id":"sha256:1caad06726d22e15968be10f791187b14dec33e5e2fd778d565218c16f0ad269"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MT2KOIOVZCESIICCA7LUHZUDP/bundle.json","state_url":"https://pith.science/pith/4MT2KOIOVZCESIICCA7LUHZUDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MT2KOIOVZCESIICCA7LUHZUDP/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-02T02:28:51Z","links":{"resolver":"https://pith.science/pith/4MT2KOIOVZCESIICCA7LUHZUDP","bundle":"https://pith.science/pith/4MT2KOIOVZCESIICCA7LUHZUDP/bundle.json","state":"https://pith.science/pith/4MT2KOIOVZCESIICCA7LUHZUDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MT2KOIOVZCESIICCA7LUHZUDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4MT2KOIOVZCESIICCA7LUHZUDP","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":"a778064d857f7ec78f1018c46be5c632682419073c0e70d39ce4f8a7c09aa89e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-07-30T09:04:25Z","title_canon_sha256":"8d02e7e0bfe83b0819f6c25994a8b11feb5d05c1b84e5b64d9551944ca88897f"},"schema_version":"1.0","source":{"id":"1608.00095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00095","created_at":"2026-05-18T01:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00095v1","created_at":"2026-05-18T01:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00095","created_at":"2026-05-18T01:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"4MT2KOIOVZCE","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4MT2KOIOVZCESIIC","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4MT2KOIO","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:1caad06726d22e15968be10f791187b14dec33e5e2fd778d565218c16f0ad269","target":"graph","created_at":"2026-05-18T01:10:13Z","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":"Service Function Chaining (SFC) is a crucial technology for future Internet. It aims to overcome the limitation of current deployment models which is rigid and static. Application of this technology relies on algorithms that can optimally mapping SFC to substrate network. This category of algorithms is referred as \"Service Function Chaining Resource Allocation (SFC-RA)\" algorithms or \"VNF placement (VNFP)\" algorithms. This paper presents a survey of current researches in SFC-RA algorithms. After presenting the formulation and related problems, several variants of SFC-RA problem are summarized.","authors_text":"Sheng Wang, Yanghao Xie, Yuxiu Wang, Zhixiang Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-07-30T09:04:25Z","title":"Service Function Chaining Resource Allocation: A Survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00095","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:f487cdf7719d5c914ae910e94a05e59c403838ef9c0518188050bbd56f74f1de","target":"record","created_at":"2026-05-18T01:10:13Z","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":"a778064d857f7ec78f1018c46be5c632682419073c0e70d39ce4f8a7c09aa89e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-07-30T09:04:25Z","title_canon_sha256":"8d02e7e0bfe83b0819f6c25994a8b11feb5d05c1b84e5b64d9551944ca88897f"},"schema_version":"1.0","source":{"id":"1608.00095","kind":"arxiv","version":1}},"canonical_sha256":"e327a5390eae44492102103eba1f341bc85168e67293b1327c8ea072208b8294","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e327a5390eae44492102103eba1f341bc85168e67293b1327c8ea072208b8294","first_computed_at":"2026-05-18T01:10:13.826207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:13.826207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wtN+CNeurY8NxuqI9k67tatAcJVJzGS1336LXibdfzYDilXD9l2lAYDXsFSlsUeM5dfMJKVwsFod+q8XoQqCAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:13.826650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f487cdf7719d5c914ae910e94a05e59c403838ef9c0518188050bbd56f74f1de","sha256:1caad06726d22e15968be10f791187b14dec33e5e2fd778d565218c16f0ad269"],"state_sha256":"74795f8bfad2cdbb93e413272e0956627e437ab35b6c318c499d754f2af1c612"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D5i2QfQ0FmNo8yl9ORZvvDXXhESvJDKErFDhDIUxDkC0z1cYOk4rbePTlSTVXJROCmt9Kio40DQdw+Vv+D8XAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:28:51.745102Z","bundle_sha256":"4f3e3d78844d12a607eaf4c9f8db5d9345edf7333f3216836d2134657f051fea"}}