{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KIO45SREEEQQQP7WY5KMGULBED","short_pith_number":"pith:KIO45SRE","canonical_record":{"source":{"id":"1102.5314","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-25T19:13:22Z","cross_cats_sorted":["cs.PF","math.IT"],"title_canon_sha256":"b32ba3e5cf4dd49cfa96227263f3ac6976158fe54bb1f5ec238f5233b3a95ace","abstract_canon_sha256":"302e0c118d3da6582be5bd5c044c67b6fe6b5b65aef509c9c2a83a896bd059f7"},"schema_version":"1.0"},"canonical_sha256":"521dceca242121083ff6c754c3516120d7e6521e52b4c0136cbc362262869f24","source":{"kind":"arxiv","id":"1102.5314","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5314","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5314v4","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5314","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"KIO45SREEEQQ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KIO45SREEEQQQP7W","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KIO45SRE","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KIO45SREEEQQQP7WY5KMGULBED","target":"record","payload":{"canonical_record":{"source":{"id":"1102.5314","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-25T19:13:22Z","cross_cats_sorted":["cs.PF","math.IT"],"title_canon_sha256":"b32ba3e5cf4dd49cfa96227263f3ac6976158fe54bb1f5ec238f5233b3a95ace","abstract_canon_sha256":"302e0c118d3da6582be5bd5c044c67b6fe6b5b65aef509c9c2a83a896bd059f7"},"schema_version":"1.0"},"canonical_sha256":"521dceca242121083ff6c754c3516120d7e6521e52b4c0136cbc362262869f24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.443993Z","signature_b64":"KISXk+/1+PhYiSh+3mu9suCCQ1Vkxo7UHjGwr5iIM2Id/SqBiEOQTR1pOW6DUHrTDQfdiwTUuQCaglje7zPoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"521dceca242121083ff6c754c3516120d7e6521e52b4c0136cbc362262869f24","last_reissued_at":"2026-05-18T00:57:57.443619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.443619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.5314","source_version":4,"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:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fzGgaXweBUDqaNbhaB34JjtQZjTRG9qKZKrBUDdw8pSTxGIevKQ+iWP8IHRSYUJTEYk2TBfBeZG927wD2wTfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:19:50.441042Z"},"content_sha256":"ca6497f9b6138fcbc3c9d1ad4425da87de4309c7a93971bc2bd4c16bdee37689","schema_version":"1.0","event_id":"sha256:ca6497f9b6138fcbc3c9d1ad4425da87de4309c7a93971bc2bd4c16bdee37689"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KIO45SREEEQQQP7WY5KMGULBED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Jointly Optimal Channel and Power Assignment for Dual-Hop Multi-channel Multi-user Relaying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Ben Liang, Mahdi Hajiaghayi, Min Dong","submitted_at":"2011-02-25T19:13:22Z","abstract_excerpt":"We consider the problem of jointly optimizing channel pairing, channel-user assignment, and power allocation, to maximize the weighted sum-rate, in a single-relay cooperative system with multiple channels and multiple users. Common relaying strategies are considered, and transmission power constraints are imposed on both individual transmitters and the aggregate over all transmitters. The joint optimization problem naturally leads to a mixed-integer program. Despite the general expectation that such problems are intractable, we construct an efficient algorithm to find an optimal solution, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5314","kind":"arxiv","version":4},"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:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XLjAbCI9oo8CpDo+Kmt86oJlQhGxfv8wyjZRgfaLDJLM2BCmvv6A6QM/RJlCaASolA5f2mdsOl8tAz8nl7pDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:19:50.441827Z"},"content_sha256":"b8f2b87c150eb62fdc3a5fdea4bf235ce04688d11b03ee64fc7ba4e48c4b541a","schema_version":"1.0","event_id":"sha256:b8f2b87c150eb62fdc3a5fdea4bf235ce04688d11b03ee64fc7ba4e48c4b541a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIO45SREEEQQQP7WY5KMGULBED/bundle.json","state_url":"https://pith.science/pith/KIO45SREEEQQQP7WY5KMGULBED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIO45SREEEQQQP7WY5KMGULBED/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-09T08:19:50Z","links":{"resolver":"https://pith.science/pith/KIO45SREEEQQQP7WY5KMGULBED","bundle":"https://pith.science/pith/KIO45SREEEQQQP7WY5KMGULBED/bundle.json","state":"https://pith.science/pith/KIO45SREEEQQQP7WY5KMGULBED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIO45SREEEQQQP7WY5KMGULBED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KIO45SREEEQQQP7WY5KMGULBED","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":"302e0c118d3da6582be5bd5c044c67b6fe6b5b65aef509c9c2a83a896bd059f7","cross_cats_sorted":["cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-25T19:13:22Z","title_canon_sha256":"b32ba3e5cf4dd49cfa96227263f3ac6976158fe54bb1f5ec238f5233b3a95ace"},"schema_version":"1.0","source":{"id":"1102.5314","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5314","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5314v4","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5314","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"KIO45SREEEQQ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KIO45SREEEQQQP7W","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KIO45SRE","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:b8f2b87c150eb62fdc3a5fdea4bf235ce04688d11b03ee64fc7ba4e48c4b541a","target":"graph","created_at":"2026-05-18T00:57:57Z","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 consider the problem of jointly optimizing channel pairing, channel-user assignment, and power allocation, to maximize the weighted sum-rate, in a single-relay cooperative system with multiple channels and multiple users. Common relaying strategies are considered, and transmission power constraints are imposed on both individual transmitters and the aggregate over all transmitters. The joint optimization problem naturally leads to a mixed-integer program. Despite the general expectation that such problems are intractable, we construct an efficient algorithm to find an optimal solution, whic","authors_text":"Ben Liang, Mahdi Hajiaghayi, Min Dong","cross_cats":["cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-25T19:13:22Z","title":"Jointly Optimal Channel and Power Assignment for Dual-Hop Multi-channel Multi-user Relaying"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5314","kind":"arxiv","version":4},"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:ca6497f9b6138fcbc3c9d1ad4425da87de4309c7a93971bc2bd4c16bdee37689","target":"record","created_at":"2026-05-18T00:57:57Z","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":"302e0c118d3da6582be5bd5c044c67b6fe6b5b65aef509c9c2a83a896bd059f7","cross_cats_sorted":["cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-25T19:13:22Z","title_canon_sha256":"b32ba3e5cf4dd49cfa96227263f3ac6976158fe54bb1f5ec238f5233b3a95ace"},"schema_version":"1.0","source":{"id":"1102.5314","kind":"arxiv","version":4}},"canonical_sha256":"521dceca242121083ff6c754c3516120d7e6521e52b4c0136cbc362262869f24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"521dceca242121083ff6c754c3516120d7e6521e52b4c0136cbc362262869f24","first_computed_at":"2026-05-18T00:57:57.443619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:57.443619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KISXk+/1+PhYiSh+3mu9suCCQ1Vkxo7UHjGwr5iIM2Id/SqBiEOQTR1pOW6DUHrTDQfdiwTUuQCaglje7zPoAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:57.443993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5314","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca6497f9b6138fcbc3c9d1ad4425da87de4309c7a93971bc2bd4c16bdee37689","sha256:b8f2b87c150eb62fdc3a5fdea4bf235ce04688d11b03ee64fc7ba4e48c4b541a"],"state_sha256":"23b332f5a558f7e71abf2b63a52001d039ecf08bbcc0c1ff65f2176c80f615e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9B/qvSEey3omSa39S4TWYWVBT0pXs3dwf9ObQNvfTy5a8SilZ0YFfhnlHRHojsvemM+Nm5uzBJOSdgQb5mICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:19:50.446140Z","bundle_sha256":"8f55c21025f30bd1838b0b5afdf3299caeb3dab6b103705bdafd31bb3c926405"}}