{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VHKSXK77SSULH7MSFQMQK2TI2Z","short_pith_number":"pith:VHKSXK77","schema_version":"1.0","canonical_sha256":"a9d52babff94a8b3fd922c19056a68d67c512b545ef0f16d3e371c252582e822","source":{"kind":"arxiv","id":"1502.02376","version":1},"attestation_state":"computed","paper":{"title":"Optimal Relay Selection with Non-negligible Probing Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingyan Liu, Yang Liu, Yi Ouyang","submitted_at":"2015-02-09T06:39:06Z","abstract_excerpt":"In this paper an optimal relay selection algorithm with non-negligible probing time is proposed and analyzed for cooperative wireless networks. Relay selection has been introduced to solve the degraded bandwidth efficiency problem in cooperative communication. Yet complete information of relay channels often remain unavailable for complex networks which renders the optimal selection strategies impossible for transmission source without probing the relay channels. Particularly when the number of relay candidate is large, even though probing all relay channels guarantees the finding of the best "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1502.02376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-09T06:39:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0f359206085dd634bfa49b8b46f1fa2e5ff33b22f8ff57960bfdcbdc8d20d5ce","abstract_canon_sha256":"9cbe17f384ea6a8258c8deb4058a1edf57d21f00c4a5ff5e5b04dafc8f404ec3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:42.640404Z","signature_b64":"HYDFfGnrmb1/0gLVCTycCfZ96C2fVRYR1VFjxgNZLffurTdWPV7qhbSZy7KhfS+ZW3+2Q/C8T6fRDiFWvEMuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9d52babff94a8b3fd922c19056a68d67c512b545ef0f16d3e371c252582e822","last_reissued_at":"2026-05-18T02:27:42.639537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:42.639537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Relay Selection with Non-negligible Probing Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingyan Liu, Yang Liu, Yi Ouyang","submitted_at":"2015-02-09T06:39:06Z","abstract_excerpt":"In this paper an optimal relay selection algorithm with non-negligible probing time is proposed and analyzed for cooperative wireless networks. Relay selection has been introduced to solve the degraded bandwidth efficiency problem in cooperative communication. Yet complete information of relay channels often remain unavailable for complex networks which renders the optimal selection strategies impossible for transmission source without probing the relay channels. Particularly when the number of relay candidate is large, even though probing all relay channels guarantees the finding of the best "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02376","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.02376","created_at":"2026-05-18T02:27:42.639674+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02376v1","created_at":"2026-05-18T02:27:42.639674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02376","created_at":"2026-05-18T02:27:42.639674+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHKSXK77SSUL","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHKSXK77SSULH7MS","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHKSXK77","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VHKSXK77SSULH7MSFQMQK2TI2Z","json":"https://pith.science/pith/VHKSXK77SSULH7MSFQMQK2TI2Z.json","graph_json":"https://pith.science/api/pith-number/VHKSXK77SSULH7MSFQMQK2TI2Z/graph.json","events_json":"https://pith.science/api/pith-number/VHKSXK77SSULH7MSFQMQK2TI2Z/events.json","paper":"https://pith.science/paper/VHKSXK77"},"agent_actions":{"view_html":"https://pith.science/pith/VHKSXK77SSULH7MSFQMQK2TI2Z","download_json":"https://pith.science/pith/VHKSXK77SSULH7MSFQMQK2TI2Z.json","view_paper":"https://pith.science/paper/VHKSXK77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02376&json=true","fetch_graph":"https://pith.science/api/pith-number/VHKSXK77SSULH7MSFQMQK2TI2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/VHKSXK77SSULH7MSFQMQK2TI2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHKSXK77SSULH7MSFQMQK2TI2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHKSXK77SSULH7MSFQMQK2TI2Z/action/storage_attestation","attest_author":"https://pith.science/pith/VHKSXK77SSULH7MSFQMQK2TI2Z/action/author_attestation","sign_citation":"https://pith.science/pith/VHKSXK77SSULH7MSFQMQK2TI2Z/action/citation_signature","submit_replication":"https://pith.science/pith/VHKSXK77SSULH7MSFQMQK2TI2Z/action/replication_record"}},"created_at":"2026-05-18T02:27:42.639674+00:00","updated_at":"2026-05-18T02:27:42.639674+00:00"}