{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WCMTU6TAR3OFHIF3MSA72SIUHU","short_pith_number":"pith:WCMTU6TA","canonical_record":{"source":{"id":"1809.06314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-17T16:39:30Z","cross_cats_sorted":[],"title_canon_sha256":"0c964cd393f3bf4936209d55741fcb70556d6d2369124c03d74b8aec8d3ebe7c","abstract_canon_sha256":"15f8b54a495b30ea7dc41faf263a4104373f55f97a79cdf1654bacbfcf886f35"},"schema_version":"1.0"},"canonical_sha256":"b0993a7a608edc53a0bb6481fd49143d015b369f23614c94af18a7da9b7a0504","source":{"kind":"arxiv","id":"1809.06314","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06314","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06314v1","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06314","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"WCMTU6TAR3OF","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WCMTU6TAR3OFHIF3","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WCMTU6TA","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WCMTU6TAR3OFHIF3MSA72SIUHU","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-17T16:39:30Z","cross_cats_sorted":[],"title_canon_sha256":"0c964cd393f3bf4936209d55741fcb70556d6d2369124c03d74b8aec8d3ebe7c","abstract_canon_sha256":"15f8b54a495b30ea7dc41faf263a4104373f55f97a79cdf1654bacbfcf886f35"},"schema_version":"1.0"},"canonical_sha256":"b0993a7a608edc53a0bb6481fd49143d015b369f23614c94af18a7da9b7a0504","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:35.047521Z","signature_b64":"vH7HFxjFeumKL3lOFYwz5XN6FSr3RwyZJC+GTY0aZLHM1HROvqpXnW5655bAVtGldkJiT0ArklFYG0kwptBZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0993a7a608edc53a0bb6481fd49143d015b369f23614c94af18a7da9b7a0504","last_reissued_at":"2026-05-18T00:05:35.047008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:35.047008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06314","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:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qGkHu2F/lLOtwj5qgC+ViucRomY/SsmC7IrA0UHDZCCz9vLoIJNHRaK1VXdoBODCtQiQrVpYPv7HM1xE8SUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:08:24.814222Z"},"content_sha256":"a7cd656fd7e0376233fe8a21e225ee8767e824b16d339766f2201c399bccd8ad","schema_version":"1.0","event_id":"sha256:a7cd656fd7e0376233fe8a21e225ee8767e824b16d339766f2201c399bccd8ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WCMTU6TAR3OFHIF3MSA72SIUHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable network adaptation for Cloud-RANs: An imitation learning approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Jun Zhang, Khaled B. Letaief, Yifei Shen, Yuanming Shi","submitted_at":"2018-09-17T16:39:30Z","abstract_excerpt":"Network adaptation is essential for the efficient operation of Cloud-RANs. Unfortunately, it leads to highly intractable mixed-integer nonlinear programming problems. Existing solutions typically rely on convex relaxation, which yield performance gaps that are difficult to quantify. Meanwhile, global optimization algorithms such as branch-and-bound can find optimal solutions but with prohibitive computational complexity. In this paper, to obtain near-optimal solutions at affordable complexity, we propose to approximate the branch-and-bound algorithm via machine learning. Specifically, the prun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06314","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:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pYztV97SE8aKoYBk7Cfcyf+70ZabRj1s201jQiLa6yA/mSM00MA8MY/xJYDT1GdX96M7oZiv+PApGwRg8OKkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:08:24.814890Z"},"content_sha256":"7991b915324d8f03026937e93a5a7bdc89b086c91ed217848de094dc42bfceb5","schema_version":"1.0","event_id":"sha256:7991b915324d8f03026937e93a5a7bdc89b086c91ed217848de094dc42bfceb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCMTU6TAR3OFHIF3MSA72SIUHU/bundle.json","state_url":"https://pith.science/pith/WCMTU6TAR3OFHIF3MSA72SIUHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCMTU6TAR3OFHIF3MSA72SIUHU/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-06T13:08:24Z","links":{"resolver":"https://pith.science/pith/WCMTU6TAR3OFHIF3MSA72SIUHU","bundle":"https://pith.science/pith/WCMTU6TAR3OFHIF3MSA72SIUHU/bundle.json","state":"https://pith.science/pith/WCMTU6TAR3OFHIF3MSA72SIUHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCMTU6TAR3OFHIF3MSA72SIUHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WCMTU6TAR3OFHIF3MSA72SIUHU","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":"15f8b54a495b30ea7dc41faf263a4104373f55f97a79cdf1654bacbfcf886f35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-17T16:39:30Z","title_canon_sha256":"0c964cd393f3bf4936209d55741fcb70556d6d2369124c03d74b8aec8d3ebe7c"},"schema_version":"1.0","source":{"id":"1809.06314","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06314","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06314v1","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06314","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"WCMTU6TAR3OF","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WCMTU6TAR3OFHIF3","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WCMTU6TA","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:7991b915324d8f03026937e93a5a7bdc89b086c91ed217848de094dc42bfceb5","target":"graph","created_at":"2026-05-18T00:05:35Z","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 adaptation is essential for the efficient operation of Cloud-RANs. Unfortunately, it leads to highly intractable mixed-integer nonlinear programming problems. Existing solutions typically rely on convex relaxation, which yield performance gaps that are difficult to quantify. Meanwhile, global optimization algorithms such as branch-and-bound can find optimal solutions but with prohibitive computational complexity. In this paper, to obtain near-optimal solutions at affordable complexity, we propose to approximate the branch-and-bound algorithm via machine learning. Specifically, the prun","authors_text":"Jun Zhang, Khaled B. Letaief, Yifei Shen, Yuanming Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-17T16:39:30Z","title":"Scalable network adaptation for Cloud-RANs: An imitation learning approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06314","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:a7cd656fd7e0376233fe8a21e225ee8767e824b16d339766f2201c399bccd8ad","target":"record","created_at":"2026-05-18T00:05:35Z","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":"15f8b54a495b30ea7dc41faf263a4104373f55f97a79cdf1654bacbfcf886f35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-17T16:39:30Z","title_canon_sha256":"0c964cd393f3bf4936209d55741fcb70556d6d2369124c03d74b8aec8d3ebe7c"},"schema_version":"1.0","source":{"id":"1809.06314","kind":"arxiv","version":1}},"canonical_sha256":"b0993a7a608edc53a0bb6481fd49143d015b369f23614c94af18a7da9b7a0504","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0993a7a608edc53a0bb6481fd49143d015b369f23614c94af18a7da9b7a0504","first_computed_at":"2026-05-18T00:05:35.047008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:35.047008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vH7HFxjFeumKL3lOFYwz5XN6FSr3RwyZJC+GTY0aZLHM1HROvqpXnW5655bAVtGldkJiT0ArklFYG0kwptBZCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:35.047521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06314","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7cd656fd7e0376233fe8a21e225ee8767e824b16d339766f2201c399bccd8ad","sha256:7991b915324d8f03026937e93a5a7bdc89b086c91ed217848de094dc42bfceb5"],"state_sha256":"9e103f9e717478b35fcd8144a98a1d394d769aa3fb1763686ec228724a7ef4fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gVq9KI1luXRXaJ9E38emJuGaCHZHNKe2A1JJMeih8uTJkiccQbGlGZJX19aaAtfkmCJ7mgh+RziP7z3gxx5sCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:08:24.818740Z","bundle_sha256":"b9e846504905961bc55fae36e6613f13f5f1418975ce50d6d01d6f246e7213af"}}