{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O476DKRHV3PQ4NGQXS3WLKRAUE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2fa05d786e7cbe1911dfbd83638440305c2f7c31e7976b224cfe154e7aa0629a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-12T07:55:30Z","title_canon_sha256":"1411ad3619ec19ad36e7d97a76af9398baa23906816e34247121fab550b5eaef"},"schema_version":"1.0","source":{"id":"1709.04361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04361","created_at":"2026-05-18T00:01:30Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04361v1","created_at":"2026-05-18T00:01:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04361","created_at":"2026-05-18T00:01:30Z"},{"alias_kind":"pith_short_12","alias_value":"O476DKRHV3PQ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O476DKRHV3PQ4NGQ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O476DKRH","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:47fc4dc9a15628e03469e9ff791cd04c0ae546cfa6fc12391ca0a261b379bd77","target":"graph","created_at":"2026-05-18T00:01:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Consider the problem of a multiple access channel in a time dependent environment with a large number of users. In such a system, mostly due to practical constraints (e.g., decoding complexity), not all users can be scheduled together, and usually only one user may transmit at any given time. Assuming a distributed, opportunistic scheduling algorithm, we analyse the system's properties, such as delay, QoS and capacity scaling laws. Specifically, we start with analyzing the performance while \\emph{assuming the users are not necessarily fully backlogged}, focusing on the queueing problem and, es","authors_text":"Asaf Cohen, Omer Gurewitz, Ori Shmuel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-12T07:55:30Z","title":"Distributed Scheduling in Time Dependent Environments: Algorithms and Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04361","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:67168404f7fa9037cc7441d83dc8d70d4d1970fc6dba00d5eb1d859c4809dcb3","target":"record","created_at":"2026-05-18T00:01:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2fa05d786e7cbe1911dfbd83638440305c2f7c31e7976b224cfe154e7aa0629a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-12T07:55:30Z","title_canon_sha256":"1411ad3619ec19ad36e7d97a76af9398baa23906816e34247121fab550b5eaef"},"schema_version":"1.0","source":{"id":"1709.04361","kind":"arxiv","version":1}},"canonical_sha256":"773fe1aa27aedf0e34d0bcb765aa20a11f324f54929d5e557a299317a3d80f01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"773fe1aa27aedf0e34d0bcb765aa20a11f324f54929d5e557a299317a3d80f01","first_computed_at":"2026-05-18T00:01:30.445083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:30.445083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sP+SVi40JPmHMjob3fm1dTDvKZbWL02TPwDessAURmIXwmg7sc/U16TZstKA76y7IEWgi18MWc4GyJXBNNzNAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:30.445554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67168404f7fa9037cc7441d83dc8d70d4d1970fc6dba00d5eb1d859c4809dcb3","sha256:47fc4dc9a15628e03469e9ff791cd04c0ae546cfa6fc12391ca0a261b379bd77"],"state_sha256":"e2b25dd3b20d98fb1f0867b8234549b54d7e9d54f95066869dbe7c386972f67b"}