{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MWAZAASV3NKHNLJSIAECVUJMHI","short_pith_number":"pith:MWAZAASV","canonical_record":{"source":{"id":"1608.06026","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-08-22T01:31:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"161751b21b67404f07c16775f56af29a6a1d9fc42430b2e3e8b8378d00fbdeff","abstract_canon_sha256":"d33f2a0890eec5a4aa4228a0ffb9f134919df831ef2bdba9db397b61ebe5d133"},"schema_version":"1.0"},"canonical_sha256":"6581900255db5476ad3240082ad12c3a2a364b19cfaa791ab8c4f6286f0797a4","source":{"kind":"arxiv","id":"1608.06026","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06026","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06026v1","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06026","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"MWAZAASV3NKH","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MWAZAASV3NKHNLJS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MWAZAASV","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MWAZAASV3NKHNLJSIAECVUJMHI","target":"record","payload":{"canonical_record":{"source":{"id":"1608.06026","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-08-22T01:31:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"161751b21b67404f07c16775f56af29a6a1d9fc42430b2e3e8b8378d00fbdeff","abstract_canon_sha256":"d33f2a0890eec5a4aa4228a0ffb9f134919df831ef2bdba9db397b61ebe5d133"},"schema_version":"1.0"},"canonical_sha256":"6581900255db5476ad3240082ad12c3a2a364b19cfaa791ab8c4f6286f0797a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:22.518995Z","signature_b64":"R8Z0vdpPWGdjEQU+We2nF4sediUQ+/HpeooWqPdHu6SmidE20QPW5KXW7KPZ6iYqsky1Rs2Ayq2QnaUfHKuiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6581900255db5476ad3240082ad12c3a2a364b19cfaa791ab8c4f6286f0797a4","last_reissued_at":"2026-05-18T01:08:22.518061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:22.518061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.06026","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:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"659wa5OaziG5n29I1N+GwMng5SK0/L4FNSGKe6xuWjEkU91mRknJTfDidpU2AwI3wS4GhINmBE0PNoO3ttk5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:31:07.622626Z"},"content_sha256":"f3aa0b45dc4db77294b134b0ee37e5372e07824d4bbcff2a7cf2bd0754fae0dd","schema_version":"1.0","event_id":"sha256:f3aa0b45dc4db77294b134b0ee37e5372e07824d4bbcff2a7cf2bd0754fae0dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MWAZAASV3NKHNLJSIAECVUJMHI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy Efficient Cooperative Network Coding with Joint Relay Scheduling and Power Allocation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lixin Li, Mikael Skoglund, Ming Xiao, Nan Qi, Phuong L. Cao, Theodoros A. Tsiftsis","submitted_at":"2016-08-22T01:31:32Z","abstract_excerpt":"The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption and EE and formulate the maximizing EE problem under the outage probability constraints. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, \\emph{etc}) and optimize the transmitting power under the practical channel and power consumption models. Since the optimization problem is NP-hard, to reduce computational complexity, the ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06026","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:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZOGPZd7vvmt3rRnrdztXDK5FK3LLD1+c8bJvZ4Q7VTB+15LoF2NiXAmi8XukiGLfql6Uy0obc7+1uaRQCPyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:31:07.623408Z"},"content_sha256":"a7343f205e29d55c9c146aa6f08ef49bb3cc35ef8c1dd522f0c18d675108bad4","schema_version":"1.0","event_id":"sha256:a7343f205e29d55c9c146aa6f08ef49bb3cc35ef8c1dd522f0c18d675108bad4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWAZAASV3NKHNLJSIAECVUJMHI/bundle.json","state_url":"https://pith.science/pith/MWAZAASV3NKHNLJSIAECVUJMHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWAZAASV3NKHNLJSIAECVUJMHI/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-30T07:31:07Z","links":{"resolver":"https://pith.science/pith/MWAZAASV3NKHNLJSIAECVUJMHI","bundle":"https://pith.science/pith/MWAZAASV3NKHNLJSIAECVUJMHI/bundle.json","state":"https://pith.science/pith/MWAZAASV3NKHNLJSIAECVUJMHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWAZAASV3NKHNLJSIAECVUJMHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MWAZAASV3NKHNLJSIAECVUJMHI","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":"d33f2a0890eec5a4aa4228a0ffb9f134919df831ef2bdba9db397b61ebe5d133","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-08-22T01:31:32Z","title_canon_sha256":"161751b21b67404f07c16775f56af29a6a1d9fc42430b2e3e8b8378d00fbdeff"},"schema_version":"1.0","source":{"id":"1608.06026","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06026","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06026v1","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06026","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"MWAZAASV3NKH","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MWAZAASV3NKHNLJS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MWAZAASV","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:a7343f205e29d55c9c146aa6f08ef49bb3cc35ef8c1dd522f0c18d675108bad4","target":"graph","created_at":"2026-05-18T01:08:22Z","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":"The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption and EE and formulate the maximizing EE problem under the outage probability constraints. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, \\emph{etc}) and optimize the transmitting power under the practical channel and power consumption models. Since the optimization problem is NP-hard, to reduce computational complexity, the ou","authors_text":"Lixin Li, Mikael Skoglund, Ming Xiao, Nan Qi, Phuong L. Cao, Theodoros A. Tsiftsis","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-08-22T01:31:32Z","title":"Energy Efficient Cooperative Network Coding with Joint Relay Scheduling and Power Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06026","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:f3aa0b45dc4db77294b134b0ee37e5372e07824d4bbcff2a7cf2bd0754fae0dd","target":"record","created_at":"2026-05-18T01:08:22Z","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":"d33f2a0890eec5a4aa4228a0ffb9f134919df831ef2bdba9db397b61ebe5d133","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-08-22T01:31:32Z","title_canon_sha256":"161751b21b67404f07c16775f56af29a6a1d9fc42430b2e3e8b8378d00fbdeff"},"schema_version":"1.0","source":{"id":"1608.06026","kind":"arxiv","version":1}},"canonical_sha256":"6581900255db5476ad3240082ad12c3a2a364b19cfaa791ab8c4f6286f0797a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6581900255db5476ad3240082ad12c3a2a364b19cfaa791ab8c4f6286f0797a4","first_computed_at":"2026-05-18T01:08:22.518061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:22.518061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R8Z0vdpPWGdjEQU+We2nF4sediUQ+/HpeooWqPdHu6SmidE20QPW5KXW7KPZ6iYqsky1Rs2Ayq2QnaUfHKuiBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:22.518995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06026","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3aa0b45dc4db77294b134b0ee37e5372e07824d4bbcff2a7cf2bd0754fae0dd","sha256:a7343f205e29d55c9c146aa6f08ef49bb3cc35ef8c1dd522f0c18d675108bad4"],"state_sha256":"abd62e7a7a353bd883d07801f9636daf5f7682ac70e188f9ff857e9489a12a9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5t2N4iEFfKJNlq283zINKAZPgGWzqDbQYGIIGQpayx41rI61Tss37o+cv4g47dp3/8urO6zWE/+xx60z0eShAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:31:07.627753Z","bundle_sha256":"6fd864c4100f0d354a9f1082f9635924f4932f038edf271570e302ea3ca58fcf"}}