{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GZPFWDFKTYUDEKVPL24FGP5ZLV","short_pith_number":"pith:GZPFWDFK","schema_version":"1.0","canonical_sha256":"365e5b0caa9e28322aaf5eb8533fb95d4f59fcfba947cc7c2a523343404b174a","source":{"kind":"arxiv","id":"1102.5461","version":1},"attestation_state":"computed","paper":{"title":"Distributed Opportunistic Channel Access in Wireless Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hai Jiang, Zhou Zhang","submitted_at":"2011-02-26T23:56:03Z","abstract_excerpt":"In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a random access procedure. A winner source node may give up its transmission opportunity if its link quality is poor. In this research, we apply the optimal stopping theory to analyze when a winner node should give up its transmission opportunity. By assuming the winner node has information of channel gains of links from itself to relays and from relays to its d"},"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":"1102.5461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-26T23:56:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6a474b9b1a5451c843475d07037b65f92ec4b83465793d52e890a99afb950f12","abstract_canon_sha256":"53db8e2e390a29367df901b836931d945f12bd5ac1d444ffb281c2b7255848e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:31.055634Z","signature_b64":"RNFNh9kZjkwTKGo0PAhwJxQPgilT/0SZipZ1QBTXAWrC1W6kzLNhJTjYRcSAhbUIVJy5DNml5fJg7ZKsMq8XBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"365e5b0caa9e28322aaf5eb8533fb95d4f59fcfba947cc7c2a523343404b174a","last_reissued_at":"2026-05-18T02:22:31.055006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:31.055006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Opportunistic Channel Access in Wireless Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hai Jiang, Zhou Zhang","submitted_at":"2011-02-26T23:56:03Z","abstract_excerpt":"In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a random access procedure. A winner source node may give up its transmission opportunity if its link quality is poor. In this research, we apply the optimal stopping theory to analyze when a winner node should give up its transmission opportunity. By assuming the winner node has information of channel gains of links from itself to relays and from relays to its d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5461","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":"1102.5461","created_at":"2026-05-18T02:22:31.055085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5461v1","created_at":"2026-05-18T02:22:31.055085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5461","created_at":"2026-05-18T02:22:31.055085+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZPFWDFKTYUD","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZPFWDFKTYUDEKVP","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZPFWDFK","created_at":"2026-05-18T12:26:30.835961+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/GZPFWDFKTYUDEKVPL24FGP5ZLV","json":"https://pith.science/pith/GZPFWDFKTYUDEKVPL24FGP5ZLV.json","graph_json":"https://pith.science/api/pith-number/GZPFWDFKTYUDEKVPL24FGP5ZLV/graph.json","events_json":"https://pith.science/api/pith-number/GZPFWDFKTYUDEKVPL24FGP5ZLV/events.json","paper":"https://pith.science/paper/GZPFWDFK"},"agent_actions":{"view_html":"https://pith.science/pith/GZPFWDFKTYUDEKVPL24FGP5ZLV","download_json":"https://pith.science/pith/GZPFWDFKTYUDEKVPL24FGP5ZLV.json","view_paper":"https://pith.science/paper/GZPFWDFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5461&json=true","fetch_graph":"https://pith.science/api/pith-number/GZPFWDFKTYUDEKVPL24FGP5ZLV/graph.json","fetch_events":"https://pith.science/api/pith-number/GZPFWDFKTYUDEKVPL24FGP5ZLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZPFWDFKTYUDEKVPL24FGP5ZLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZPFWDFKTYUDEKVPL24FGP5ZLV/action/storage_attestation","attest_author":"https://pith.science/pith/GZPFWDFKTYUDEKVPL24FGP5ZLV/action/author_attestation","sign_citation":"https://pith.science/pith/GZPFWDFKTYUDEKVPL24FGP5ZLV/action/citation_signature","submit_replication":"https://pith.science/pith/GZPFWDFKTYUDEKVPL24FGP5ZLV/action/replication_record"}},"created_at":"2026-05-18T02:22:31.055085+00:00","updated_at":"2026-05-18T02:22:31.055085+00:00"}