{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:AJ7J4SO7WHPGSN7UQU7W7SYVRN","short_pith_number":"pith:AJ7J4SO7","schema_version":"1.0","canonical_sha256":"027e9e49dfb1de6937f4853f6fcb158b781a342d79ca080d0e9e14a1af4ac339","source":{"kind":"arxiv","id":"0712.1169","version":3},"attestation_state":"computed","paper":{"title":"Opportunistic Relaying in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander M. Haimovich, H. Vincent Poor, Oren Somekh, Shengshan Cui","submitted_at":"2007-12-07T16:19:52Z","abstract_excerpt":"Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying protocols have been reported in the literature. However, most of the proposed solutions require either centrally coordinated scheduling or detailed channel state information (CSI) at the transmitter side. Here, an opportunistic relaying scheme is proposed, which alleviates these limitations. The scheme entails a two-hop communication protocol, in which sources"},"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":"0712.1169","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-12-07T16:19:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9d8b02b3335f2ee6d20cefaadffb6bcb66a01c8e83972a88791ac6991a97059","abstract_canon_sha256":"eeca910171395c9db8a138fdc9817a6713bfc85e32f674e9528451a707470fcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.977546Z","signature_b64":"3xM9u1XdecygmaCJi0Qt95e0q0maCpyqCO2WpK4u89O4QgARNk+4TYIDferrIUIsNJPZvf9BVisOXSKPd2JQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"027e9e49dfb1de6937f4853f6fcb158b781a342d79ca080d0e9e14a1af4ac339","last_reissued_at":"2026-05-18T00:59:11.976874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.976874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Opportunistic Relaying in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander M. Haimovich, H. Vincent Poor, Oren Somekh, Shengshan Cui","submitted_at":"2007-12-07T16:19:52Z","abstract_excerpt":"Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying protocols have been reported in the literature. However, most of the proposed solutions require either centrally coordinated scheduling or detailed channel state information (CSI) at the transmitter side. Here, an opportunistic relaying scheme is proposed, which alleviates these limitations. The scheme entails a two-hop communication protocol, in which sources"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.1169","kind":"arxiv","version":3},"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":"0712.1169","created_at":"2026-05-18T00:59:11.976988+00:00"},{"alias_kind":"arxiv_version","alias_value":"0712.1169v3","created_at":"2026-05-18T00:59:11.976988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.1169","created_at":"2026-05-18T00:59:11.976988+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJ7J4SO7WHPG","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJ7J4SO7WHPGSN7U","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJ7J4SO7","created_at":"2026-05-18T12:25:55.427421+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/AJ7J4SO7WHPGSN7UQU7W7SYVRN","json":"https://pith.science/pith/AJ7J4SO7WHPGSN7UQU7W7SYVRN.json","graph_json":"https://pith.science/api/pith-number/AJ7J4SO7WHPGSN7UQU7W7SYVRN/graph.json","events_json":"https://pith.science/api/pith-number/AJ7J4SO7WHPGSN7UQU7W7SYVRN/events.json","paper":"https://pith.science/paper/AJ7J4SO7"},"agent_actions":{"view_html":"https://pith.science/pith/AJ7J4SO7WHPGSN7UQU7W7SYVRN","download_json":"https://pith.science/pith/AJ7J4SO7WHPGSN7UQU7W7SYVRN.json","view_paper":"https://pith.science/paper/AJ7J4SO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0712.1169&json=true","fetch_graph":"https://pith.science/api/pith-number/AJ7J4SO7WHPGSN7UQU7W7SYVRN/graph.json","fetch_events":"https://pith.science/api/pith-number/AJ7J4SO7WHPGSN7UQU7W7SYVRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJ7J4SO7WHPGSN7UQU7W7SYVRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJ7J4SO7WHPGSN7UQU7W7SYVRN/action/storage_attestation","attest_author":"https://pith.science/pith/AJ7J4SO7WHPGSN7UQU7W7SYVRN/action/author_attestation","sign_citation":"https://pith.science/pith/AJ7J4SO7WHPGSN7UQU7W7SYVRN/action/citation_signature","submit_replication":"https://pith.science/pith/AJ7J4SO7WHPGSN7UQU7W7SYVRN/action/replication_record"}},"created_at":"2026-05-18T00:59:11.976988+00:00","updated_at":"2026-05-18T00:59:11.976988+00:00"}