{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Q475MEAGAQCUGTR4KQPC7QLMWN","short_pith_number":"pith:Q475MEAG","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"},"canonical_sha256":"873fd610060405434e3c541e2fc16cb35cabd0d7e0c3a2fcd0a87198efd13756","source":{"kind":"arxiv","id":"1507.03255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03255","created_at":"2026-05-18T01:36:59Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03255v1","created_at":"2026-05-18T01:36:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03255","created_at":"2026-05-18T01:36:59Z"},{"alias_kind":"pith_short_12","alias_value":"Q475MEAGAQCU","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q475MEAGAQCUGTR4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q475MEAG","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Q475MEAGAQCUGTR4KQPC7QLMWN","target":"record","payload":{"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"},"canonical_sha256":"873fd610060405434e3c541e2fc16cb35cabd0d7e0c3a2fcd0a87198efd13756","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"},"source_kind":"arxiv","source_id":"1507.03255","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8K6+IwyoVYq6ebvLkWvhk7G/5FYY6kRA4ZbCiNzUutSBm7GA/5W3I4g+gyL/vTYMx+jflO/pOHMVMqYkFxOpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:11:00.454419Z"},"content_sha256":"3cd960b536ad921d308f2ff694c3bf9f53f4b811a767b031e531d06c4291da7a","schema_version":"1.0","event_id":"sha256:3cd960b536ad921d308f2ff694c3bf9f53f4b811a767b031e531d06c4291da7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Q475MEAGAQCUGTR4KQPC7QLMWN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cEhQoFt8LAho1zBBCTVJjLF263YGq/wF9q27FjtFB5C2Zp9V+GKzO5mHsEhft6tbqdHNOH+6pAFMwXFuTkqoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:11:00.454770Z"},"content_sha256":"adaa65eaf33886a0aa61949de555d078384fe9a036b106b3e4593791ac0c8758","schema_version":"1.0","event_id":"sha256:adaa65eaf33886a0aa61949de555d078384fe9a036b106b3e4593791ac0c8758"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN/bundle.json","state_url":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q475MEAGAQCUGTR4KQPC7QLMWN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T17:11:00Z","links":{"resolver":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN","bundle":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN/bundle.json","state":"https://pith.science/pith/Q475MEAGAQCUGTR4KQPC7QLMWN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q475MEAGAQCUGTR4KQPC7QLMWN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Q475MEAGAQCUGTR4KQPC7QLMWN","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":"fd7e4de3dea82fa92909b964aa8674362b9554c0ffa6b2ca20c5c94baeae9f64","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-12T17:49:43Z","title_canon_sha256":"a4176adcbdf176100a00bd2dc862d10aa0373a39eb2caa2f8328d1ef260cc418"},"schema_version":"1.0","source":{"id":"1507.03255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03255","created_at":"2026-05-18T01:36:59Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03255v1","created_at":"2026-05-18T01:36:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03255","created_at":"2026-05-18T01:36:59Z"},{"alias_kind":"pith_short_12","alias_value":"Q475MEAGAQCU","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q475MEAGAQCUGTR4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q475MEAG","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:adaa65eaf33886a0aa61949de555d078384fe9a036b106b3e4593791ac0c8758","target":"graph","created_at":"2026-05-18T01:36:59Z","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 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","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":"2015-07-12T17:49:43Z","title":"Capacity and performance analysis for multi-user system under distributed opportunistic scheduling in a time dependent channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03255","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:3cd960b536ad921d308f2ff694c3bf9f53f4b811a767b031e531d06c4291da7a","target":"record","created_at":"2026-05-18T01:36:59Z","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":"fd7e4de3dea82fa92909b964aa8674362b9554c0ffa6b2ca20c5c94baeae9f64","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-12T17:49:43Z","title_canon_sha256":"a4176adcbdf176100a00bd2dc862d10aa0373a39eb2caa2f8328d1ef260cc418"},"schema_version":"1.0","source":{"id":"1507.03255","kind":"arxiv","version":1}},"canonical_sha256":"873fd610060405434e3c541e2fc16cb35cabd0d7e0c3a2fcd0a87198efd13756","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"873fd610060405434e3c541e2fc16cb35cabd0d7e0c3a2fcd0a87198efd13756","first_computed_at":"2026-05-18T01:36:59.291895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:59.291895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gq6KFdnaudWIWxLvR0dBuj2+XxPdaHQhW3bncut2C0dGMieAwB0ZJeCl79YClA8X1p4amnt2voB67Vv/4MOFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:59.292664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cd960b536ad921d308f2ff694c3bf9f53f4b811a767b031e531d06c4291da7a","sha256:adaa65eaf33886a0aa61949de555d078384fe9a036b106b3e4593791ac0c8758"],"state_sha256":"7449c78e5cf6f6ab6597be9f7095e988a7f8b0f84ca70ec05b08a7ae81cfc6c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81/9JhvFPAzhC872qBlIMYJ/vNKDBybCJhZTGRz0qjSdbrGIYOOT2PuFvpy7vbc+yCBonG2QF4cUT8GtDIOtCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:11:00.456631Z","bundle_sha256":"6db13d642c4e24ef8e35ba3b955e0f384c3a23c7c3d81dc0515de161008729d4"}}