{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MPGIOZX3KLCBHS43KBPOV6FPQA","short_pith_number":"pith:MPGIOZX3","schema_version":"1.0","canonical_sha256":"63cc8766fb52c413cb9b505eeaf8af80025de7edc48ef0362aa8324496f1d43c","source":{"kind":"arxiv","id":"1510.01764","version":1},"attestation_state":"computed","paper":{"title":"On the Throughput of Multi-Source Multi-Destination Relay Networks with Queueing Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"M. Cenk Gursoy, Senem Velipasalar, Yi Li","submitted_at":"2015-10-06T21:23:31Z","abstract_excerpt":"In this paper, the throughput of relay networks with multiple source-destination pairs under queueing constraints has been investigated for both variable-rate and fixed-rate schemes. When channel side information (CSI) is available at the transmitter side, transmitters can adapt their transmission rates according to the channel conditions, and achieve the instantaneous channel capacities. In this case, the departure rates at each node have been characterized for different system parameters, which control the power allocation, time allocation and decoding order. In the other case of no CSI at t"},"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":"1510.01764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-06T21:23:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51963c1f53cc723831d8bae624e5a75f514bbcdd164202687cca7576540e4f8b","abstract_canon_sha256":"4fadeb6231d7174843b777ce513827cd129960a8c534482d1180a56505ac0e65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:50.454085Z","signature_b64":"QJ0T9l+MXL8fGLQmfPalAkILjMwWQzcgvNW3amQYImcrxLDsdM7ukSjqcZY9lmPDQM3h9kTUioF32/iJemHPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63cc8766fb52c413cb9b505eeaf8af80025de7edc48ef0362aa8324496f1d43c","last_reissued_at":"2026-05-18T01:30:50.453571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:50.453571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Throughput of Multi-Source Multi-Destination Relay Networks with Queueing Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"M. Cenk Gursoy, Senem Velipasalar, Yi Li","submitted_at":"2015-10-06T21:23:31Z","abstract_excerpt":"In this paper, the throughput of relay networks with multiple source-destination pairs under queueing constraints has been investigated for both variable-rate and fixed-rate schemes. When channel side information (CSI) is available at the transmitter side, transmitters can adapt their transmission rates according to the channel conditions, and achieve the instantaneous channel capacities. In this case, the departure rates at each node have been characterized for different system parameters, which control the power allocation, time allocation and decoding order. In the other case of no CSI at t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01764","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":"1510.01764","created_at":"2026-05-18T01:30:50.453656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01764v1","created_at":"2026-05-18T01:30:50.453656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01764","created_at":"2026-05-18T01:30:50.453656+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPGIOZX3KLCB","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPGIOZX3KLCBHS43","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPGIOZX3","created_at":"2026-05-18T12:29:32.376354+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/MPGIOZX3KLCBHS43KBPOV6FPQA","json":"https://pith.science/pith/MPGIOZX3KLCBHS43KBPOV6FPQA.json","graph_json":"https://pith.science/api/pith-number/MPGIOZX3KLCBHS43KBPOV6FPQA/graph.json","events_json":"https://pith.science/api/pith-number/MPGIOZX3KLCBHS43KBPOV6FPQA/events.json","paper":"https://pith.science/paper/MPGIOZX3"},"agent_actions":{"view_html":"https://pith.science/pith/MPGIOZX3KLCBHS43KBPOV6FPQA","download_json":"https://pith.science/pith/MPGIOZX3KLCBHS43KBPOV6FPQA.json","view_paper":"https://pith.science/paper/MPGIOZX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01764&json=true","fetch_graph":"https://pith.science/api/pith-number/MPGIOZX3KLCBHS43KBPOV6FPQA/graph.json","fetch_events":"https://pith.science/api/pith-number/MPGIOZX3KLCBHS43KBPOV6FPQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPGIOZX3KLCBHS43KBPOV6FPQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPGIOZX3KLCBHS43KBPOV6FPQA/action/storage_attestation","attest_author":"https://pith.science/pith/MPGIOZX3KLCBHS43KBPOV6FPQA/action/author_attestation","sign_citation":"https://pith.science/pith/MPGIOZX3KLCBHS43KBPOV6FPQA/action/citation_signature","submit_replication":"https://pith.science/pith/MPGIOZX3KLCBHS43KBPOV6FPQA/action/replication_record"}},"created_at":"2026-05-18T01:30:50.453656+00:00","updated_at":"2026-05-18T01:30:50.453656+00:00"}