{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WHOSPVWSXOAEHLDJFBEFZH326Z","short_pith_number":"pith:WHOSPVWS","canonical_record":{"source":{"id":"1811.01744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-01T21:30:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"849bf9edbb4aabca5d7203fd30153a45b7b5396661366c6468076a8d6f73bd69","abstract_canon_sha256":"22370595ff48046d34e4b976876d36b5e5e3e7017678bc2c612005c13c2fc5fb"},"schema_version":"1.0"},"canonical_sha256":"b1dd27d6d2bb8043ac6928485c9f7af65fe198a86274ed5e2678a102a879db6c","source":{"kind":"arxiv","id":"1811.01744","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01744","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01744v1","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01744","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"pith_short_12","alias_value":"WHOSPVWSXOAE","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WHOSPVWSXOAEHLDJ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WHOSPVWS","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WHOSPVWSXOAEHLDJFBEFZH326Z","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-01T21:30:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"849bf9edbb4aabca5d7203fd30153a45b7b5396661366c6468076a8d6f73bd69","abstract_canon_sha256":"22370595ff48046d34e4b976876d36b5e5e3e7017678bc2c612005c13c2fc5fb"},"schema_version":"1.0"},"canonical_sha256":"b1dd27d6d2bb8043ac6928485c9f7af65fe198a86274ed5e2678a102a879db6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:33.383832Z","signature_b64":"XoFmNpKdgKETtWQ+UOMycoueOvZ6qwzac/f1YLpROQfo9KRRfMn9xIQmVfk22bAKLzsHMK2DCbl0QJ7t0nlfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1dd27d6d2bb8043ac6928485c9f7af65fe198a86274ed5e2678a102a879db6c","last_reissued_at":"2026-05-18T00:01:33.383353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:33.383353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01744","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:01:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LlBBd7sdj9HdyYm8SyQTlh8QrgfbYGuF61K86UulSaE62ADLaaUTUc1bk/X0Lg1fTIySqQXk8Gs0p+aqzWQ+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:02:57.453999Z"},"content_sha256":"6f284d6e1cc6084d5ac86d5434bb6c1f4c5836a464d1d2cf164537e0926fe6aa","schema_version":"1.0","event_id":"sha256:6f284d6e1cc6084d5ac86d5434bb6c1f4c5836a464d1d2cf164537e0926fe6aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WHOSPVWSXOAEHLDJFBEFZH326Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Slicing with Mobile Edge Computing for Micro-Operator Networks in Beyond 5G","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dusit Niyato, Matti Latva-aho, Nandana Rajatheva, Tachporn Sanguanpuak","submitted_at":"2018-11-01T21:30:40Z","abstract_excerpt":"We model the scenarios of network slicing allocation for the micro-operator (MO) network. The MO creates the slices \"as a service\" of wireless resource and then allocates these slices to multiple mobile network operators (MNOs). We propose the slice allocation problem of multiple MNOs with the goal of maximizing the social welfare of the network defined as sum rate of all MNOs. The many-to-one matching game framework is adopted to solve this problem. Then, the generic Markov Chain Monte Carlo (MCMC) method is introduced for the computation of game theoretical solution. After the MNOs obtain th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01744","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:01:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5Z2ogmoqfn3e6ZdExpFe3qKmKRaKAfsMoQAx8o22wmTSnTGJLADp84HQVM9cvkUqbk/ACH/6h+kJaP0UX/lAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:02:57.454672Z"},"content_sha256":"f8c365a04c9a9f3d0c53ee3e50d01b1826d8a44da92acb99deaa584192aed2d2","schema_version":"1.0","event_id":"sha256:f8c365a04c9a9f3d0c53ee3e50d01b1826d8a44da92acb99deaa584192aed2d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHOSPVWSXOAEHLDJFBEFZH326Z/bundle.json","state_url":"https://pith.science/pith/WHOSPVWSXOAEHLDJFBEFZH326Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHOSPVWSXOAEHLDJFBEFZH326Z/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-05-30T05:02:57Z","links":{"resolver":"https://pith.science/pith/WHOSPVWSXOAEHLDJFBEFZH326Z","bundle":"https://pith.science/pith/WHOSPVWSXOAEHLDJFBEFZH326Z/bundle.json","state":"https://pith.science/pith/WHOSPVWSXOAEHLDJFBEFZH326Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHOSPVWSXOAEHLDJFBEFZH326Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WHOSPVWSXOAEHLDJFBEFZH326Z","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":"22370595ff48046d34e4b976876d36b5e5e3e7017678bc2c612005c13c2fc5fb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-01T21:30:40Z","title_canon_sha256":"849bf9edbb4aabca5d7203fd30153a45b7b5396661366c6468076a8d6f73bd69"},"schema_version":"1.0","source":{"id":"1811.01744","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01744","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01744v1","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01744","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"pith_short_12","alias_value":"WHOSPVWSXOAE","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WHOSPVWSXOAEHLDJ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WHOSPVWS","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:f8c365a04c9a9f3d0c53ee3e50d01b1826d8a44da92acb99deaa584192aed2d2","target":"graph","created_at":"2026-05-18T00:01:33Z","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":"We model the scenarios of network slicing allocation for the micro-operator (MO) network. The MO creates the slices \"as a service\" of wireless resource and then allocates these slices to multiple mobile network operators (MNOs). We propose the slice allocation problem of multiple MNOs with the goal of maximizing the social welfare of the network defined as sum rate of all MNOs. The many-to-one matching game framework is adopted to solve this problem. Then, the generic Markov Chain Monte Carlo (MCMC) method is introduced for the computation of game theoretical solution. After the MNOs obtain th","authors_text":"Dusit Niyato, Matti Latva-aho, Nandana Rajatheva, Tachporn Sanguanpuak","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-01T21:30:40Z","title":"Network Slicing with Mobile Edge Computing for Micro-Operator Networks in Beyond 5G"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01744","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:6f284d6e1cc6084d5ac86d5434bb6c1f4c5836a464d1d2cf164537e0926fe6aa","target":"record","created_at":"2026-05-18T00:01:33Z","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":"22370595ff48046d34e4b976876d36b5e5e3e7017678bc2c612005c13c2fc5fb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-01T21:30:40Z","title_canon_sha256":"849bf9edbb4aabca5d7203fd30153a45b7b5396661366c6468076a8d6f73bd69"},"schema_version":"1.0","source":{"id":"1811.01744","kind":"arxiv","version":1}},"canonical_sha256":"b1dd27d6d2bb8043ac6928485c9f7af65fe198a86274ed5e2678a102a879db6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1dd27d6d2bb8043ac6928485c9f7af65fe198a86274ed5e2678a102a879db6c","first_computed_at":"2026-05-18T00:01:33.383353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:33.383353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XoFmNpKdgKETtWQ+UOMycoueOvZ6qwzac/f1YLpROQfo9KRRfMn9xIQmVfk22bAKLzsHMK2DCbl0QJ7t0nlfCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:33.383832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01744","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f284d6e1cc6084d5ac86d5434bb6c1f4c5836a464d1d2cf164537e0926fe6aa","sha256:f8c365a04c9a9f3d0c53ee3e50d01b1826d8a44da92acb99deaa584192aed2d2"],"state_sha256":"173cbaff8675b4f08a5466b3968730745a6bda3339dcaef44d78089fb4a0d9fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxqXfMFUXvk3dRTDOZAZDHcAblBEqi5XhfFSfBWHcb8EaoRHXr1NAHEuCRQGDJjoPbsADDJDAhDwuCa2HyybBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:02:57.458051Z","bundle_sha256":"87e90e69c0c8945fedc76954c5cb7b896fd92ad498241e279addcd8c40a50586"}}