{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TK2O3SLGJHO22ROS2WMQSB346V","short_pith_number":"pith:TK2O3SLG","schema_version":"1.0","canonical_sha256":"9ab4edc96649ddad45d2d59909077cf5486084cc65b0e2d1eaef8cc8670b8d60","source":{"kind":"arxiv","id":"1501.07379","version":1},"attestation_state":"computed","paper":{"title":"Hardness of Virtual Network Embedding with Replica Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Carlo Fuerst, Maciej Pacut, Stefan Schmid","submitted_at":"2015-01-29T08:59:38Z","abstract_excerpt":"Efficient embedding virtual clusters in physical network is a challenging problem. In this paper we consider a scenario where physical network has a structure of a balanced tree. This assumption is justified by many real- world implementations of datacenters. We consider an extension to virtual cluster embedding by introducing replication among data chunks. In many real-world applications, data is stored in distributed and redundant way. This assumption introduces additional hardness in deciding what replica to process. By reduction from classical NP-complete problem of Boolean Satisfia- bilit"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1501.07379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-29T08:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"00b942319d2ee59323c62e7456f1f6b17b299a1a97151f453deaf15c21712954","abstract_canon_sha256":"a4fbc543353dfc4979d5c6482e5d47c258014f1cc2b64af2f66b9747b0d0ca17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:22.096394Z","signature_b64":"R78Q8bt5nCuvqu3LBe1+6mWRG4NpIlpgjaKJdXLxYalbT+PGxJtOecNKD7/dZp9qbFdL3lUijqplLDcxZ+XoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ab4edc96649ddad45d2d59909077cf5486084cc65b0e2d1eaef8cc8670b8d60","last_reissued_at":"2026-05-18T02:28:22.095731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:22.095731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of Virtual Network Embedding with Replica Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Carlo Fuerst, Maciej Pacut, Stefan Schmid","submitted_at":"2015-01-29T08:59:38Z","abstract_excerpt":"Efficient embedding virtual clusters in physical network is a challenging problem. In this paper we consider a scenario where physical network has a structure of a balanced tree. This assumption is justified by many real- world implementations of datacenters. We consider an extension to virtual cluster embedding by introducing replication among data chunks. In many real-world applications, data is stored in distributed and redundant way. This assumption introduces additional hardness in deciding what replica to process. By reduction from classical NP-complete problem of Boolean Satisfia- bilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07379","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.07379","created_at":"2026-05-18T02:28:22.095831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07379v1","created_at":"2026-05-18T02:28:22.095831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07379","created_at":"2026-05-18T02:28:22.095831+00:00"},{"alias_kind":"pith_short_12","alias_value":"TK2O3SLGJHO2","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TK2O3SLGJHO22ROS","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TK2O3SLG","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TK2O3SLGJHO22ROS2WMQSB346V","json":"https://pith.science/pith/TK2O3SLGJHO22ROS2WMQSB346V.json","graph_json":"https://pith.science/api/pith-number/TK2O3SLGJHO22ROS2WMQSB346V/graph.json","events_json":"https://pith.science/api/pith-number/TK2O3SLGJHO22ROS2WMQSB346V/events.json","paper":"https://pith.science/paper/TK2O3SLG"},"agent_actions":{"view_html":"https://pith.science/pith/TK2O3SLGJHO22ROS2WMQSB346V","download_json":"https://pith.science/pith/TK2O3SLGJHO22ROS2WMQSB346V.json","view_paper":"https://pith.science/paper/TK2O3SLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07379&json=true","fetch_graph":"https://pith.science/api/pith-number/TK2O3SLGJHO22ROS2WMQSB346V/graph.json","fetch_events":"https://pith.science/api/pith-number/TK2O3SLGJHO22ROS2WMQSB346V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TK2O3SLGJHO22ROS2WMQSB346V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TK2O3SLGJHO22ROS2WMQSB346V/action/storage_attestation","attest_author":"https://pith.science/pith/TK2O3SLGJHO22ROS2WMQSB346V/action/author_attestation","sign_citation":"https://pith.science/pith/TK2O3SLGJHO22ROS2WMQSB346V/action/citation_signature","submit_replication":"https://pith.science/pith/TK2O3SLGJHO22ROS2WMQSB346V/action/replication_record"}},"created_at":"2026-05-18T02:28:22.095831+00:00","updated_at":"2026-05-18T02:28:22.095831+00:00"}