{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HHNIYMO43EH37WS5W5M7WR6QZH","short_pith_number":"pith:HHNIYMO4","canonical_record":{"source":{"id":"1606.02213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-07T16:57:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ae4c4347a4ccd7a0ad9b1eb789fe93ecc454728873f387af939461d7f9d3871e","abstract_canon_sha256":"743dc236b846e2880d7656de7630a6e82259c4720fe83fc8c13fa51836e0eb5d"},"schema_version":"1.0"},"canonical_sha256":"39da8c31dcd90fbfda5db759fb47d0c9e642ca0a94484393bdae5bbf91ac27ef","source":{"kind":"arxiv","id":"1606.02213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02213","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02213v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02213","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"HHNIYMO43EH3","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HHNIYMO43EH37WS5","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HHNIYMO4","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HHNIYMO43EH37WS5W5M7WR6QZH","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-07T16:57:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ae4c4347a4ccd7a0ad9b1eb789fe93ecc454728873f387af939461d7f9d3871e","abstract_canon_sha256":"743dc236b846e2880d7656de7630a6e82259c4720fe83fc8c13fa51836e0eb5d"},"schema_version":"1.0"},"canonical_sha256":"39da8c31dcd90fbfda5db759fb47d0c9e642ca0a94484393bdae5bbf91ac27ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:09.310555Z","signature_b64":"wckN40tRgCe16q7GHYD1TfU552WljLWQZlFwLq1iO//c0H9JLwC32xuByKLi6OUKh2mFjE9VRA0bbCjAxdALAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39da8c31dcd90fbfda5db759fb47d0c9e642ca0a94484393bdae5bbf91ac27ef","last_reissued_at":"2026-05-18T00:58:09.309929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:09.309929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02213","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:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPtQXQvuaWC+qNoV8f0yQLqkBf08t4RM5zeUQ5MUMVfrkKCveNUDzbxmS5/1mLTW0NdUwDBMKe8eAcux+jZ0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:36:50.682442Z"},"content_sha256":"a38710f0574c8339a1ac80116d798f64d808d429ba0a34ae4388a661ae358764","schema_version":"1.0","event_id":"sha256:a38710f0574c8339a1ac80116d798f64d808d429ba0a34ae4388a661ae358764"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HHNIYMO43EH37WS5W5M7WR6QZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-Aware Relay Selection and Power Allocation for Multiple-User Cooperative Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ranjan Bose, Sabyasachi Gupta","submitted_at":"2016-06-07T16:57:03Z","abstract_excerpt":"This paper investigates the relay assignment and power allocation problem for two different network power management policies: group lifetime maximization (GLM) and minimum weighted total power (MWTP), with the aim of lifetime maximization in symbol error rate (SER) constrained multipleuser cooperative network. With optimal power allocation solution obtained for each policy, we show that the optimal relay assignment can be obtained using bottleneck matching (BM) algorithm and minimum weighted matching (MWM) algorithm for GLM and MWTP policies, respectively. Since relay assignment with BM algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02213","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:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87IWw/pM7Bl8v478YiPc53ZKLdDeQpORWxU7Jx1eMP8XL8Ts4TUGFwcXVPNaDbqjIgbZawZOKASs1C/gTqj7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:36:50.682898Z"},"content_sha256":"745c96a790a350ceb5b4f661b88beb80fd813ed1f0d0e698b777257ac08bee57","schema_version":"1.0","event_id":"sha256:745c96a790a350ceb5b4f661b88beb80fd813ed1f0d0e698b777257ac08bee57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHNIYMO43EH37WS5W5M7WR6QZH/bundle.json","state_url":"https://pith.science/pith/HHNIYMO43EH37WS5W5M7WR6QZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHNIYMO43EH37WS5W5M7WR6QZH/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-27T10:36:50Z","links":{"resolver":"https://pith.science/pith/HHNIYMO43EH37WS5W5M7WR6QZH","bundle":"https://pith.science/pith/HHNIYMO43EH37WS5W5M7WR6QZH/bundle.json","state":"https://pith.science/pith/HHNIYMO43EH37WS5W5M7WR6QZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHNIYMO43EH37WS5W5M7WR6QZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HHNIYMO43EH37WS5W5M7WR6QZH","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":"743dc236b846e2880d7656de7630a6e82259c4720fe83fc8c13fa51836e0eb5d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-07T16:57:03Z","title_canon_sha256":"ae4c4347a4ccd7a0ad9b1eb789fe93ecc454728873f387af939461d7f9d3871e"},"schema_version":"1.0","source":{"id":"1606.02213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02213","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02213v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02213","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"HHNIYMO43EH3","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HHNIYMO43EH37WS5","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HHNIYMO4","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:745c96a790a350ceb5b4f661b88beb80fd813ed1f0d0e698b777257ac08bee57","target":"graph","created_at":"2026-05-18T00:58:09Z","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 investigates the relay assignment and power allocation problem for two different network power management policies: group lifetime maximization (GLM) and minimum weighted total power (MWTP), with the aim of lifetime maximization in symbol error rate (SER) constrained multipleuser cooperative network. With optimal power allocation solution obtained for each policy, we show that the optimal relay assignment can be obtained using bottleneck matching (BM) algorithm and minimum weighted matching (MWM) algorithm for GLM and MWTP policies, respectively. Since relay assignment with BM algor","authors_text":"Ranjan Bose, Sabyasachi Gupta","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-07T16:57:03Z","title":"Energy-Aware Relay Selection and Power Allocation for Multiple-User Cooperative Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02213","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:a38710f0574c8339a1ac80116d798f64d808d429ba0a34ae4388a661ae358764","target":"record","created_at":"2026-05-18T00:58:09Z","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":"743dc236b846e2880d7656de7630a6e82259c4720fe83fc8c13fa51836e0eb5d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-07T16:57:03Z","title_canon_sha256":"ae4c4347a4ccd7a0ad9b1eb789fe93ecc454728873f387af939461d7f9d3871e"},"schema_version":"1.0","source":{"id":"1606.02213","kind":"arxiv","version":1}},"canonical_sha256":"39da8c31dcd90fbfda5db759fb47d0c9e642ca0a94484393bdae5bbf91ac27ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39da8c31dcd90fbfda5db759fb47d0c9e642ca0a94484393bdae5bbf91ac27ef","first_computed_at":"2026-05-18T00:58:09.309929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:09.309929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wckN40tRgCe16q7GHYD1TfU552WljLWQZlFwLq1iO//c0H9JLwC32xuByKLi6OUKh2mFjE9VRA0bbCjAxdALAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:09.310555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a38710f0574c8339a1ac80116d798f64d808d429ba0a34ae4388a661ae358764","sha256:745c96a790a350ceb5b4f661b88beb80fd813ed1f0d0e698b777257ac08bee57"],"state_sha256":"3ed32522c1a0da3fa791b90cae955f1a887a59e2ee039f5d68ef845a485743f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eXd4VLy5XT9E+mgcOyaBGKndOPSJfj2nwWHQMX43nWpKCSdm7tMZkwScTwAD9kZHlIM2dZ/W6x/qdqFJvz0ZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:36:50.686084Z","bundle_sha256":"c3b67e5e7f450c2c7cfd872796dcca59157e8eac95e179c6e870316c34e28e39"}}