{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Q475MEAGAQCUGTR4KQPC7QLMWN","short_pith_number":"pith:Q475MEAG","schema_version":"1.0","canonical_sha256":"873fd610060405434e3c541e2fc16cb35cabd0d7e0c3a2fcd0a87198efd13756","source":{"kind":"arxiv","id":"1507.03255","version":1},"attestation_state":"computed","paper":{"title":"Capacity and performance analysis for multi-user system under distributed opportunistic scheduling in a time dependent channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Omer Gurewitz, Ori Shmuel","submitted_at":"2015-07-12T17:49:43Z","abstract_excerpt":"Consider the problem of a multi-user multiple access channel. While several multi-user coding techniques exist, in practical scenarios, not all users can be scheduled simultaneously. Thus, a key problem is which users to schedule in a given time slot. Under realistic approach for time dependency of the channel, we adopt a distributed scheduling algorithm in which each user, in the beginning of each slot, estimates his channel gain and compares it to a threshold, and if exceeding it the user can transmit. In this work we are interested in the expected capacity of the system and the delay and qu"},"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":"1507.03255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-12T17:49:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a4176adcbdf176100a00bd2dc862d10aa0373a39eb2caa2f8328d1ef260cc418","abstract_canon_sha256":"fd7e4de3dea82fa92909b964aa8674362b9554c0ffa6b2ca20c5c94baeae9f64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:59.292664Z","signature_b64":"gq6KFdnaudWIWxLvR0dBuj2+XxPdaHQhW3bncut2C0dGMieAwB0ZJeCl79YClA8X1p4amnt2voB67Vv/4MOFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"873fd610060405434e3c541e2fc16cb35cabd0d7e0c3a2fcd0a87198efd13756","last_reissued_at":"2026-05-18T01:36:59.291895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:59.291895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity and performance analysis for multi-user system under distributed opportunistic scheduling in a time dependent channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Omer Gurewitz, Ori Shmuel","submitted_at":"2015-07-12T17:49:43Z","abstract_excerpt":"Consider the problem of a multi-user multiple access channel. While several multi-user coding techniques exist, in practical scenarios, not all users can be scheduled simultaneously. Thus, a key problem is which users to schedule in a given time slot. Under realistic approach for time dependency of the channel, we adopt a distributed scheduling algorithm in which each user, in the beginning of each slot, estimates his channel gain and compares it to a threshold, and if exceeding it the user can transmit. In this work we are interested in the expected capacity of the system and the delay and qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03255","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":"1507.03255","created_at":"2026-05-18T01:36:59.292053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03255v1","created_at":"2026-05-18T01:36:59.292053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03255","created_at":"2026-05-18T01:36:59.292053+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q475MEAGAQCU","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q475MEAGAQCUGTR4","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q475MEAG","created_at":"2026-05-18T12:29:37.295048+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/Q475MEAGAQCUGTR4KQPC7QLMWN","json":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN.json","graph_json":"https://pith.science/api/pith-number/Q475MEAGAQCUGTR4KQPC7QLMWN/graph.json","events_json":"https://pith.science/api/pith-number/Q475MEAGAQCUGTR4KQPC7QLMWN/events.json","paper":"https://pith.science/paper/Q475MEAG"},"agent_actions":{"view_html":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN","download_json":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN.json","view_paper":"https://pith.science/paper/Q475MEAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03255&json=true","fetch_graph":"https://pith.science/api/pith-number/Q475MEAGAQCUGTR4KQPC7QLMWN/graph.json","fetch_events":"https://pith.science/api/pith-number/Q475MEAGAQCUGTR4KQPC7QLMWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN/action/storage_attestation","attest_author":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN/action/author_attestation","sign_citation":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN/action/citation_signature","submit_replication":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN/action/replication_record"}},"created_at":"2026-05-18T01:36:59.292053+00:00","updated_at":"2026-05-18T01:36:59.292053+00:00"}