{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OGCBXSKAZHLPZMGGXUEKKAOOET","short_pith_number":"pith:OGCBXSKA","schema_version":"1.0","canonical_sha256":"71841bc940c9d6fcb0c6bd08a501ce24c1d9807663a7db639efad944b7acd9a0","source":{"kind":"arxiv","id":"1106.0735","version":1},"attestation_state":"computed","paper":{"title":"Cross-Layer Scheduling for Cooperative Multi-Hop Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Dongyue Xue, Eylem Ekici","submitted_at":"2011-06-03T19:48:30Z","abstract_excerpt":"The paper aims to design cross-layer optimal scheduling algorithms for cooperative multi-hop Cognitive Radio Networks (CRNs), where secondary users (SUs) assist primary user (PU)'s multi-hop transmissions and in return gain authorization to access a share of the spectrum. We build two models for two different types of PUs, corresponding to elastic and inelastic service classes. For CRNs with elastic service, the PU maximizes its throughput while assigning a time-share of the channel to SUs proportional to SUs' assistance. For the inelastic case, the PU is guaranteed a minimum utility. The prop"},"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":"1106.0735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-06-03T19:48:30Z","cross_cats_sorted":[],"title_canon_sha256":"db9eb9b8d8976661b5f39e5e94eee0f00f9a47a77882a91d323fa73ea643a718","abstract_canon_sha256":"abfe33635148628dc53fd51fe7c288bac5ef1415c060dd7ef7af463c396ba9b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:39.592615Z","signature_b64":"+HfSHvksJiqoPywWIe/X4wx27fyeak0BOYrIuePwVyHWFK5D9QH/iWmVuFeyqDBgRYxmXqS37/UxQSqOQ+hcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71841bc940c9d6fcb0c6bd08a501ce24c1d9807663a7db639efad944b7acd9a0","last_reissued_at":"2026-05-18T04:20:39.591919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:39.591919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cross-Layer Scheduling for Cooperative Multi-Hop Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Dongyue Xue, Eylem Ekici","submitted_at":"2011-06-03T19:48:30Z","abstract_excerpt":"The paper aims to design cross-layer optimal scheduling algorithms for cooperative multi-hop Cognitive Radio Networks (CRNs), where secondary users (SUs) assist primary user (PU)'s multi-hop transmissions and in return gain authorization to access a share of the spectrum. We build two models for two different types of PUs, corresponding to elastic and inelastic service classes. For CRNs with elastic service, the PU maximizes its throughput while assigning a time-share of the channel to SUs proportional to SUs' assistance. For the inelastic case, the PU is guaranteed a minimum utility. The prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0735","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":"1106.0735","created_at":"2026-05-18T04:20:39.592018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.0735v1","created_at":"2026-05-18T04:20:39.592018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0735","created_at":"2026-05-18T04:20:39.592018+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGCBXSKAZHLP","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGCBXSKAZHLPZMGG","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGCBXSKA","created_at":"2026-05-18T12:26:37.096874+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/OGCBXSKAZHLPZMGGXUEKKAOOET","json":"https://pith.science/pith/OGCBXSKAZHLPZMGGXUEKKAOOET.json","graph_json":"https://pith.science/api/pith-number/OGCBXSKAZHLPZMGGXUEKKAOOET/graph.json","events_json":"https://pith.science/api/pith-number/OGCBXSKAZHLPZMGGXUEKKAOOET/events.json","paper":"https://pith.science/paper/OGCBXSKA"},"agent_actions":{"view_html":"https://pith.science/pith/OGCBXSKAZHLPZMGGXUEKKAOOET","download_json":"https://pith.science/pith/OGCBXSKAZHLPZMGGXUEKKAOOET.json","view_paper":"https://pith.science/paper/OGCBXSKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.0735&json=true","fetch_graph":"https://pith.science/api/pith-number/OGCBXSKAZHLPZMGGXUEKKAOOET/graph.json","fetch_events":"https://pith.science/api/pith-number/OGCBXSKAZHLPZMGGXUEKKAOOET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGCBXSKAZHLPZMGGXUEKKAOOET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGCBXSKAZHLPZMGGXUEKKAOOET/action/storage_attestation","attest_author":"https://pith.science/pith/OGCBXSKAZHLPZMGGXUEKKAOOET/action/author_attestation","sign_citation":"https://pith.science/pith/OGCBXSKAZHLPZMGGXUEKKAOOET/action/citation_signature","submit_replication":"https://pith.science/pith/OGCBXSKAZHLPZMGGXUEKKAOOET/action/replication_record"}},"created_at":"2026-05-18T04:20:39.592018+00:00","updated_at":"2026-05-18T04:20:39.592018+00:00"}