{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LQ6XJBIHUOR66UNZ3PL4ZBT2WH","short_pith_number":"pith:LQ6XJBIH","canonical_record":{"source":{"id":"1305.0619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-03T04:04:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e74fdc52e58abda9c3aee7495e5280db37378103297cbc44591c5a045d4135a8","abstract_canon_sha256":"68e948ab8fd794b4d2f7190a0369f10d0bf8f76057343d33d06ac41d2a939119"},"schema_version":"1.0"},"canonical_sha256":"5c3d748507a3a3ef51b9dbd7cc867ab1c9e05ec9ee60316d68d0a5683fb9f404","source":{"kind":"arxiv","id":"1305.0619","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0619","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0619v1","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0619","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"LQ6XJBIHUOR6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LQ6XJBIHUOR66UNZ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LQ6XJBIH","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LQ6XJBIHUOR66UNZ3PL4ZBT2WH","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-03T04:04:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e74fdc52e58abda9c3aee7495e5280db37378103297cbc44591c5a045d4135a8","abstract_canon_sha256":"68e948ab8fd794b4d2f7190a0369f10d0bf8f76057343d33d06ac41d2a939119"},"schema_version":"1.0"},"canonical_sha256":"5c3d748507a3a3ef51b9dbd7cc867ab1c9e05ec9ee60316d68d0a5683fb9f404","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:33.186433Z","signature_b64":"tdtl8BYhV8W5Dky3m+5dV16kK0ZLpp6otqI/EavR5jPZSkBddCzGtFo83fk9qtI0JgJNMcATaOOakk+dj+5VBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c3d748507a3a3ef51b9dbd7cc867ab1c9e05ec9ee60316d68d0a5683fb9f404","last_reissued_at":"2026-05-18T03:26:33.186021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:33.186021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0619","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-18T03:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ZRPV13RSjn/b4nAzwCte0PlbgwDF8+M0EOrK8r+I2+jsb0jGjSCm9YH2CvNLJMMluyuFGjlGD17znbubdqfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:02:22.279413Z"},"content_sha256":"7cc42a5aaf460041b0f13f6897601f962d461728d22e81cd8c94d94eaefca3de","schema_version":"1.0","event_id":"sha256:7cc42a5aaf460041b0f13f6897601f962d461728d22e81cd8c94d94eaefca3de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LQ6XJBIHUOR66UNZ3PL4ZBT2WH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Allocation for Downlink Channel Transmission Based on Superposition Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aata El Hamss, Leszek Szczecinski, Mustapha Benjillali, Redouane Sassioui","submitted_at":"2013-05-03T04:04:39Z","abstract_excerpt":"We analyze the problem of transmitting information to multiple users over a shared wireless channel. The problem of resource allocation (RA) for the users with the knowledge of their channel state information has been treated extensively in the literature where various approaches trading off the users' throughput and fairness were proposed. The emphasis was mostly on the time-sharing (TS) approach, where the resource allocated to the user is equivalent to its time share of the channel access. In this work, we propose to take advantage of the broadcast nature of the channel and we adopt superpo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0619","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-18T03:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrPbbsiwe426r81u8ce0VBEGS581EFKP5mdf7OEJlY7GswRogd0/7Ob9aTlVfsI0Xj2NdOVwllVjy7Wk6InFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:02:22.280122Z"},"content_sha256":"7956eebd8849cabeb315a443091c4e00ce16455f6a4a12621a1e9d85df7c21ec","schema_version":"1.0","event_id":"sha256:7956eebd8849cabeb315a443091c4e00ce16455f6a4a12621a1e9d85df7c21ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQ6XJBIHUOR66UNZ3PL4ZBT2WH/bundle.json","state_url":"https://pith.science/pith/LQ6XJBIHUOR66UNZ3PL4ZBT2WH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQ6XJBIHUOR66UNZ3PL4ZBT2WH/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-11T01:02:22Z","links":{"resolver":"https://pith.science/pith/LQ6XJBIHUOR66UNZ3PL4ZBT2WH","bundle":"https://pith.science/pith/LQ6XJBIHUOR66UNZ3PL4ZBT2WH/bundle.json","state":"https://pith.science/pith/LQ6XJBIHUOR66UNZ3PL4ZBT2WH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQ6XJBIHUOR66UNZ3PL4ZBT2WH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LQ6XJBIHUOR66UNZ3PL4ZBT2WH","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":"68e948ab8fd794b4d2f7190a0369f10d0bf8f76057343d33d06ac41d2a939119","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-03T04:04:39Z","title_canon_sha256":"e74fdc52e58abda9c3aee7495e5280db37378103297cbc44591c5a045d4135a8"},"schema_version":"1.0","source":{"id":"1305.0619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0619","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0619v1","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0619","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"LQ6XJBIHUOR6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LQ6XJBIHUOR66UNZ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LQ6XJBIH","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:7956eebd8849cabeb315a443091c4e00ce16455f6a4a12621a1e9d85df7c21ec","target":"graph","created_at":"2026-05-18T03:26: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 analyze the problem of transmitting information to multiple users over a shared wireless channel. The problem of resource allocation (RA) for the users with the knowledge of their channel state information has been treated extensively in the literature where various approaches trading off the users' throughput and fairness were proposed. The emphasis was mostly on the time-sharing (TS) approach, where the resource allocated to the user is equivalent to its time share of the channel access. In this work, we propose to take advantage of the broadcast nature of the channel and we adopt superpo","authors_text":"Aata El Hamss, Leszek Szczecinski, Mustapha Benjillali, Redouane Sassioui","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-03T04:04:39Z","title":"Resource Allocation for Downlink Channel Transmission Based on Superposition Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0619","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:7cc42a5aaf460041b0f13f6897601f962d461728d22e81cd8c94d94eaefca3de","target":"record","created_at":"2026-05-18T03:26: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":"68e948ab8fd794b4d2f7190a0369f10d0bf8f76057343d33d06ac41d2a939119","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-03T04:04:39Z","title_canon_sha256":"e74fdc52e58abda9c3aee7495e5280db37378103297cbc44591c5a045d4135a8"},"schema_version":"1.0","source":{"id":"1305.0619","kind":"arxiv","version":1}},"canonical_sha256":"5c3d748507a3a3ef51b9dbd7cc867ab1c9e05ec9ee60316d68d0a5683fb9f404","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c3d748507a3a3ef51b9dbd7cc867ab1c9e05ec9ee60316d68d0a5683fb9f404","first_computed_at":"2026-05-18T03:26:33.186021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:33.186021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tdtl8BYhV8W5Dky3m+5dV16kK0ZLpp6otqI/EavR5jPZSkBddCzGtFo83fk9qtI0JgJNMcATaOOakk+dj+5VBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:33.186433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cc42a5aaf460041b0f13f6897601f962d461728d22e81cd8c94d94eaefca3de","sha256:7956eebd8849cabeb315a443091c4e00ce16455f6a4a12621a1e9d85df7c21ec"],"state_sha256":"0ce1bf25157518d96cea9f9686e1a6f52ba8987e16b6345f829162f001144c88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MGiAPD9UYR85sMM0JNJgmVBrWScQFsDPwmRYR3LyfdivHHTQC14lIroeecnXGXabKcaUiL21e11HUrjSgT29BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:02:22.283891Z","bundle_sha256":"0219a4741728d057cfdcfc9fd10a4f005183d5e158d3f9ef79d72655cb339be0"}}