{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5FGUCC54J2LOAUYBPM63AZQ4Q5","short_pith_number":"pith:5FGUCC54","canonical_record":{"source":{"id":"1605.05037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-17T07:04:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"136c3079f8a381362cf56542ebec0186ef9caad5726ebfbbc48f4438e1eaeadf","abstract_canon_sha256":"446634a241aa96d7eaacb6ae87cdb88508cae48b7bb2c734fc623137db5ba150"},"schema_version":"1.0"},"canonical_sha256":"e94d410bbc4e96e053017b3db0661c8767d1fd7dd901ca8eb89c62fb5f7e73b4","source":{"kind":"arxiv","id":"1605.05037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05037","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05037v1","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05037","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"5FGUCC54J2LO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5FGUCC54J2LOAUYB","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5FGUCC54","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5FGUCC54J2LOAUYBPM63AZQ4Q5","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-17T07:04:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"136c3079f8a381362cf56542ebec0186ef9caad5726ebfbbc48f4438e1eaeadf","abstract_canon_sha256":"446634a241aa96d7eaacb6ae87cdb88508cae48b7bb2c734fc623137db5ba150"},"schema_version":"1.0"},"canonical_sha256":"e94d410bbc4e96e053017b3db0661c8767d1fd7dd901ca8eb89c62fb5f7e73b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:37.634542Z","signature_b64":"xA0EgeWVQd8T3RzDjSQ7E1rl6GwUbfbzsgAXM014oIRm0ZTYhdRUbSF3a1VQDkiEV4HzXnHkGgk9ydBbyIpuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e94d410bbc4e96e053017b3db0661c8767d1fd7dd901ca8eb89c62fb5f7e73b4","last_reissued_at":"2026-05-18T01:14:37.633816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:37.633816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05037","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:14:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k00fzcHMYldOwcCgL7pH0tMd8lhCmja/eAvTUKnEAaF1jWYNUMF2tJM25I0kbHvbFDR47hnaKZnhqpT3Ep2VBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:54:22.622186Z"},"content_sha256":"07f47d69ef71aa9e059580804636cc6bd846555a14664c9723081a92d4146392","schema_version":"1.0","event_id":"sha256:07f47d69ef71aa9e059580804636cc6bd846555a14664c9723081a92d4146392"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5FGUCC54J2LOAUYBPM63AZQ4Q5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cloud-Based Topological Interference Management: A Case with No Cooperative Transmission Gain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aly El Gamal","submitted_at":"2016-05-17T07:04:35Z","abstract_excerpt":"We study the problem of managing interference in linear networks, with backhaul constraints that admit centralized allocation of messages to transmitters through the cloud. Our setting is that of a generic channel, where no channel state information is available at the transmitters. Knowing only the network topology, we characterize the optimal decisions for assigning messages to transmitters, given that each receiver is interested in one message that can be available at N transmitters. We show that using linear cooperation schemes, the per user degrees of freedom does not increase as we incre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05037","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:14:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lLShZuOVxlajDwZuhE0mldf/QYBTuXm/RfObLbLg35ORWDirqgxtfeJtRx0gsOQ60dG91pxMcLkziXd/Oqs3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:54:22.622833Z"},"content_sha256":"cc094fcf193c14fa85529ee4c6504de04d171a5b6b4373af268e0e3803158a38","schema_version":"1.0","event_id":"sha256:cc094fcf193c14fa85529ee4c6504de04d171a5b6b4373af268e0e3803158a38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5FGUCC54J2LOAUYBPM63AZQ4Q5/bundle.json","state_url":"https://pith.science/pith/5FGUCC54J2LOAUYBPM63AZQ4Q5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5FGUCC54J2LOAUYBPM63AZQ4Q5/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-09T10:54:22Z","links":{"resolver":"https://pith.science/pith/5FGUCC54J2LOAUYBPM63AZQ4Q5","bundle":"https://pith.science/pith/5FGUCC54J2LOAUYBPM63AZQ4Q5/bundle.json","state":"https://pith.science/pith/5FGUCC54J2LOAUYBPM63AZQ4Q5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5FGUCC54J2LOAUYBPM63AZQ4Q5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5FGUCC54J2LOAUYBPM63AZQ4Q5","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":"446634a241aa96d7eaacb6ae87cdb88508cae48b7bb2c734fc623137db5ba150","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-17T07:04:35Z","title_canon_sha256":"136c3079f8a381362cf56542ebec0186ef9caad5726ebfbbc48f4438e1eaeadf"},"schema_version":"1.0","source":{"id":"1605.05037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05037","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05037v1","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05037","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"5FGUCC54J2LO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5FGUCC54J2LOAUYB","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5FGUCC54","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:cc094fcf193c14fa85529ee4c6504de04d171a5b6b4373af268e0e3803158a38","target":"graph","created_at":"2026-05-18T01:14:37Z","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 study the problem of managing interference in linear networks, with backhaul constraints that admit centralized allocation of messages to transmitters through the cloud. Our setting is that of a generic channel, where no channel state information is available at the transmitters. Knowing only the network topology, we characterize the optimal decisions for assigning messages to transmitters, given that each receiver is interested in one message that can be available at N transmitters. We show that using linear cooperation schemes, the per user degrees of freedom does not increase as we incre","authors_text":"Aly El Gamal","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-17T07:04:35Z","title":"Cloud-Based Topological Interference Management: A Case with No Cooperative Transmission Gain"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05037","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:07f47d69ef71aa9e059580804636cc6bd846555a14664c9723081a92d4146392","target":"record","created_at":"2026-05-18T01:14:37Z","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":"446634a241aa96d7eaacb6ae87cdb88508cae48b7bb2c734fc623137db5ba150","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-17T07:04:35Z","title_canon_sha256":"136c3079f8a381362cf56542ebec0186ef9caad5726ebfbbc48f4438e1eaeadf"},"schema_version":"1.0","source":{"id":"1605.05037","kind":"arxiv","version":1}},"canonical_sha256":"e94d410bbc4e96e053017b3db0661c8767d1fd7dd901ca8eb89c62fb5f7e73b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e94d410bbc4e96e053017b3db0661c8767d1fd7dd901ca8eb89c62fb5f7e73b4","first_computed_at":"2026-05-18T01:14:37.633816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:37.633816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xA0EgeWVQd8T3RzDjSQ7E1rl6GwUbfbzsgAXM014oIRm0ZTYhdRUbSF3a1VQDkiEV4HzXnHkGgk9ydBbyIpuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:37.634542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07f47d69ef71aa9e059580804636cc6bd846555a14664c9723081a92d4146392","sha256:cc094fcf193c14fa85529ee4c6504de04d171a5b6b4373af268e0e3803158a38"],"state_sha256":"0f959a934d63a15d256bcb30bebe4888606ace5b3bc33d564db36e980746892c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sW21UFXJin0o4lZZSeJkwpJAVQjA/lkFlfNbSxZ4+XtWqlbCMNcX84FQ+vx8hd711Aqwczv5gWNIqQBvyT0RBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:54:22.626461Z","bundle_sha256":"ae0f2c988e914b349653998587dd2b779a79ac9fa2ca6f859d7ba26a746984c9"}}