{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VXX7SDMDIYAY35PEVBWMI3RUZT","short_pith_number":"pith:VXX7SDMD","canonical_record":{"source":{"id":"1801.05104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T03:10:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a3977d9e172aef51bd0acde18ed139792ae6145fc5830b200510da2136bad79","abstract_canon_sha256":"df8c8cb5502be248b7325d47c4ee33f119a0481ff064b63f1499bd62af443354"},"schema_version":"1.0"},"canonical_sha256":"adeff90d8346018df5e4a86cc46e34ccfe667ada1fafa4b1abe2f9f412d918d1","source":{"kind":"arxiv","id":"1801.05104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05104","created_at":"2026-05-18T00:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05104v1","created_at":"2026-05-18T00:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05104","created_at":"2026-05-18T00:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"VXX7SDMDIYAY","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VXX7SDMDIYAY35PE","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VXX7SDMD","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VXX7SDMDIYAY35PEVBWMI3RUZT","target":"record","payload":{"canonical_record":{"source":{"id":"1801.05104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T03:10:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a3977d9e172aef51bd0acde18ed139792ae6145fc5830b200510da2136bad79","abstract_canon_sha256":"df8c8cb5502be248b7325d47c4ee33f119a0481ff064b63f1499bd62af443354"},"schema_version":"1.0"},"canonical_sha256":"adeff90d8346018df5e4a86cc46e34ccfe667ada1fafa4b1abe2f9f412d918d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:49.924570Z","signature_b64":"31DUPAt8f9cXQFGvcuP0fvcwo4uaVzsMq12tb1HzVKRgYDDJXzMk41l5uAuiilmr1uPX9ua/gUfoPzALlqbEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adeff90d8346018df5e4a86cc46e34ccfe667ada1fafa4b1abe2f9f412d918d1","last_reissued_at":"2026-05-18T00:25:49.923939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:49.923939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.05104","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:25:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qLqMStVaSiiKs57Q2a8mDe0VR7U2TTqInZnkkN8SpOJPEmrEV5GVOkvgxFJSpLJkVX1He+NdJ4FfzZdOUnIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:11:33.129661Z"},"content_sha256":"48c9442bb8548dd5768dcc6206faff95bf158c9c5b36cb75619a016b07a4edbc","schema_version":"1.0","event_id":"sha256:48c9442bb8548dd5768dcc6206faff95bf158c9c5b36cb75619a016b07a4edbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VXX7SDMDIYAY35PEVBWMI3RUZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput Maximization in Cloud Radio Access Networks using Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Douik, MD Jahangir Hossain, Mohammed S. Al-Abiad, Sameh Sorour","submitted_at":"2018-01-16T03:10:36Z","abstract_excerpt":"This paper is interested in maximizing the total throughput of cloud radio access networks (CRANs) in which multiple radio remote heads (RRHs) are connected to a central computing unit known as the cloud. The transmit frame of each RRH consists of multiple radio resources blocks (RRBs), and the cloud is responsible for synchronizing these RRBS and scheduling them to users. Unlike previous works that consider allocating each RRB to only a single user at each time instance, this paper proposes to mix the flows of multiple users in each RRB using instantly decodable network coding (IDNC). The pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05104","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:25:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X7gjxjFjf+5CEdRgs/xTNdOz5p7DYTZfDL38duPQdBUROWdQihtuCMWnE4YL5rgnkvasv3RU3/w0KgjhLEgCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:11:33.130012Z"},"content_sha256":"a64ac04cc5fa52c643896d818e3196dd8b312a69c4d101fd61d256cc71286a45","schema_version":"1.0","event_id":"sha256:a64ac04cc5fa52c643896d818e3196dd8b312a69c4d101fd61d256cc71286a45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXX7SDMDIYAY35PEVBWMI3RUZT/bundle.json","state_url":"https://pith.science/pith/VXX7SDMDIYAY35PEVBWMI3RUZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXX7SDMDIYAY35PEVBWMI3RUZT/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-23T14:11:33Z","links":{"resolver":"https://pith.science/pith/VXX7SDMDIYAY35PEVBWMI3RUZT","bundle":"https://pith.science/pith/VXX7SDMDIYAY35PEVBWMI3RUZT/bundle.json","state":"https://pith.science/pith/VXX7SDMDIYAY35PEVBWMI3RUZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXX7SDMDIYAY35PEVBWMI3RUZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VXX7SDMDIYAY35PEVBWMI3RUZT","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":"df8c8cb5502be248b7325d47c4ee33f119a0481ff064b63f1499bd62af443354","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T03:10:36Z","title_canon_sha256":"7a3977d9e172aef51bd0acde18ed139792ae6145fc5830b200510da2136bad79"},"schema_version":"1.0","source":{"id":"1801.05104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05104","created_at":"2026-05-18T00:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05104v1","created_at":"2026-05-18T00:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05104","created_at":"2026-05-18T00:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"VXX7SDMDIYAY","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VXX7SDMDIYAY35PE","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VXX7SDMD","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:a64ac04cc5fa52c643896d818e3196dd8b312a69c4d101fd61d256cc71286a45","target":"graph","created_at":"2026-05-18T00:25:49Z","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":"This paper is interested in maximizing the total throughput of cloud radio access networks (CRANs) in which multiple radio remote heads (RRHs) are connected to a central computing unit known as the cloud. The transmit frame of each RRH consists of multiple radio resources blocks (RRBs), and the cloud is responsible for synchronizing these RRBS and scheduling them to users. Unlike previous works that consider allocating each RRB to only a single user at each time instance, this paper proposes to mix the flows of multiple users in each RRB using instantly decodable network coding (IDNC). The pro","authors_text":"Ahmed Douik, MD Jahangir Hossain, Mohammed S. Al-Abiad, Sameh Sorour","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T03:10:36Z","title":"Throughput Maximization in Cloud Radio Access Networks using Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05104","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:48c9442bb8548dd5768dcc6206faff95bf158c9c5b36cb75619a016b07a4edbc","target":"record","created_at":"2026-05-18T00:25:49Z","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":"df8c8cb5502be248b7325d47c4ee33f119a0481ff064b63f1499bd62af443354","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T03:10:36Z","title_canon_sha256":"7a3977d9e172aef51bd0acde18ed139792ae6145fc5830b200510da2136bad79"},"schema_version":"1.0","source":{"id":"1801.05104","kind":"arxiv","version":1}},"canonical_sha256":"adeff90d8346018df5e4a86cc46e34ccfe667ada1fafa4b1abe2f9f412d918d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adeff90d8346018df5e4a86cc46e34ccfe667ada1fafa4b1abe2f9f412d918d1","first_computed_at":"2026-05-18T00:25:49.923939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:49.923939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"31DUPAt8f9cXQFGvcuP0fvcwo4uaVzsMq12tb1HzVKRgYDDJXzMk41l5uAuiilmr1uPX9ua/gUfoPzALlqbEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:49.924570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48c9442bb8548dd5768dcc6206faff95bf158c9c5b36cb75619a016b07a4edbc","sha256:a64ac04cc5fa52c643896d818e3196dd8b312a69c4d101fd61d256cc71286a45"],"state_sha256":"54e7becb9223e7b75afce280cf83b3660f68bdc7f05e7ca8850b1a10cbd0f71e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Hzi2Dtr9KUebKLxafC4TBgbwx3DY+3xUCP89vE05PRN7axuQ+9z5HO02RGLcwkSxdNUyxIZFmbmo6uVAjwUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:11:33.132038Z","bundle_sha256":"1dadeffcc99ad883a719f1a86fcdebb1e3398eefdefcf28f62482679ef62e94a"}}