{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:J5HNM7YL3CXIGE4USW5KNHKAVG","short_pith_number":"pith:J5HNM7YL","canonical_record":{"source":{"id":"1007.4955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-28T13:09:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f18e543591607e3c5975af91c73b5a645416ba6e12f20c884604ab5880d7295","abstract_canon_sha256":"768628347f2f205c7382e8103a2df3c1c7810037a213cfcdc97a75f28a8ca9ac"},"schema_version":"1.0"},"canonical_sha256":"4f4ed67f0bd8ae83139495baa69d40a9908090d54747a746bd14639193d1faa0","source":{"kind":"arxiv","id":"1007.4955","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4955","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4955v1","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4955","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"J5HNM7YL3CXI","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"J5HNM7YL3CXIGE4U","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"J5HNM7YL","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:J5HNM7YL3CXIGE4USW5KNHKAVG","target":"record","payload":{"canonical_record":{"source":{"id":"1007.4955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-28T13:09:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f18e543591607e3c5975af91c73b5a645416ba6e12f20c884604ab5880d7295","abstract_canon_sha256":"768628347f2f205c7382e8103a2df3c1c7810037a213cfcdc97a75f28a8ca9ac"},"schema_version":"1.0"},"canonical_sha256":"4f4ed67f0bd8ae83139495baa69d40a9908090d54747a746bd14639193d1faa0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:12.315856Z","signature_b64":"ssp8YBjcQHgFWab84yi8uGXmRTYWo0FQALnm4IYifaEptb1UsXC9m130NteIw6JdjxTh1B375ngc34nAh3JFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f4ed67f0bd8ae83139495baa69d40a9908090d54747a746bd14639193d1faa0","last_reissued_at":"2026-05-18T03:17:12.315039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:12.315039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.4955","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:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lu50hc8yJ5FoMOFLPySWl0pOIrOr7VmIzA3Wsm9utXViWLT6hN8WDk8VqiQUlS+jzQ8b3+PqXApW9mRxt1f8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:37:09.200825Z"},"content_sha256":"91e8714b40f34495658ba863ed865c92495f4beeeecc58f9f75d29ad27daa3d4","schema_version":"1.0","event_id":"sha256:91e8714b40f34495658ba863ed865c92495f4beeeecc58f9f75d29ad27daa3d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:J5HNM7YL3CXIGE4USW5KNHKAVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Dynamic Hop Selection and Power Control in Cognitive Multi-hop Relay Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Liangzhong Ruan, Vincent K.N. Lau","submitted_at":"2010-07-28T13:09:44Z","abstract_excerpt":"In this paper, we consider a cognitive multi-hop relay secondary user (SU) system sharing the spectrum with some primary users (PU). The transmit power as well as the hop selection of the cognitive relays can be dynamically adapted according to the local (and causal) knowledge of the instantaneous channel state information (CSI) in the multi-hop SU system. We shall determine a low complexity, decentralized algorithm to maximize the average end-to-end throughput of the SU system with dynamic spatial reuse. The problem is challenging due to the decentralized requirement as well as the causality "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4955","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:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTK8YFj2RoP885DIKaSDUlUr+QaV1FrYFpxndUO0ZRh2fqPzloiQkkhGSPwjG4TxUjbBWA/EPdAegqsWsTvdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:37:09.201163Z"},"content_sha256":"856767ac333a9d6a6cd10584c0d8560492d32282d0678af5dc6f17dc0f68098a","schema_version":"1.0","event_id":"sha256:856767ac333a9d6a6cd10584c0d8560492d32282d0678af5dc6f17dc0f68098a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5HNM7YL3CXIGE4USW5KNHKAVG/bundle.json","state_url":"https://pith.science/pith/J5HNM7YL3CXIGE4USW5KNHKAVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5HNM7YL3CXIGE4USW5KNHKAVG/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-01T15:37:09Z","links":{"resolver":"https://pith.science/pith/J5HNM7YL3CXIGE4USW5KNHKAVG","bundle":"https://pith.science/pith/J5HNM7YL3CXIGE4USW5KNHKAVG/bundle.json","state":"https://pith.science/pith/J5HNM7YL3CXIGE4USW5KNHKAVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5HNM7YL3CXIGE4USW5KNHKAVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:J5HNM7YL3CXIGE4USW5KNHKAVG","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":"768628347f2f205c7382e8103a2df3c1c7810037a213cfcdc97a75f28a8ca9ac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-28T13:09:44Z","title_canon_sha256":"9f18e543591607e3c5975af91c73b5a645416ba6e12f20c884604ab5880d7295"},"schema_version":"1.0","source":{"id":"1007.4955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4955","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4955v1","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4955","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"J5HNM7YL3CXI","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"J5HNM7YL3CXIGE4U","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"J5HNM7YL","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:856767ac333a9d6a6cd10584c0d8560492d32282d0678af5dc6f17dc0f68098a","target":"graph","created_at":"2026-05-18T03:17:12Z","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":"In this paper, we consider a cognitive multi-hop relay secondary user (SU) system sharing the spectrum with some primary users (PU). The transmit power as well as the hop selection of the cognitive relays can be dynamically adapted according to the local (and causal) knowledge of the instantaneous channel state information (CSI) in the multi-hop SU system. We shall determine a low complexity, decentralized algorithm to maximize the average end-to-end throughput of the SU system with dynamic spatial reuse. The problem is challenging due to the decentralized requirement as well as the causality ","authors_text":"Liangzhong Ruan, Vincent K.N. Lau","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-28T13:09:44Z","title":"Decentralized Dynamic Hop Selection and Power Control in Cognitive Multi-hop Relay Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4955","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:91e8714b40f34495658ba863ed865c92495f4beeeecc58f9f75d29ad27daa3d4","target":"record","created_at":"2026-05-18T03:17:12Z","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":"768628347f2f205c7382e8103a2df3c1c7810037a213cfcdc97a75f28a8ca9ac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-28T13:09:44Z","title_canon_sha256":"9f18e543591607e3c5975af91c73b5a645416ba6e12f20c884604ab5880d7295"},"schema_version":"1.0","source":{"id":"1007.4955","kind":"arxiv","version":1}},"canonical_sha256":"4f4ed67f0bd8ae83139495baa69d40a9908090d54747a746bd14639193d1faa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f4ed67f0bd8ae83139495baa69d40a9908090d54747a746bd14639193d1faa0","first_computed_at":"2026-05-18T03:17:12.315039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:12.315039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ssp8YBjcQHgFWab84yi8uGXmRTYWo0FQALnm4IYifaEptb1UsXC9m130NteIw6JdjxTh1B375ngc34nAh3JFDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:12.315856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.4955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91e8714b40f34495658ba863ed865c92495f4beeeecc58f9f75d29ad27daa3d4","sha256:856767ac333a9d6a6cd10584c0d8560492d32282d0678af5dc6f17dc0f68098a"],"state_sha256":"c059f89e4df56dffeffc9f309cb57fbc3109fae194c930e1e9f9afdec7ea0de9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+YTr+3RlJk7kdWW3L3ttui+knAl6EjIPa4Ajb9P9cesIW5E4GVwv4kfH0P9X3SeW8EMFBCIedEk0ls8B1wZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:37:09.203119Z","bundle_sha256":"c856679401f62c6c9ede943688936e61138daf468d8bc1af5a69107a26e788c5"}}