{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OV4RC25JHYCRW47ELCAK6EUW62","short_pith_number":"pith:OV4RC25J","canonical_record":{"source":{"id":"1404.6683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-26T21:09:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6dd48f320115baaca9ae54720baf7374e6ec63f5568112941f41906dc9198592","abstract_canon_sha256":"b53267b7cdb138a28362c5cb66cdca65e2bc9a1083ee9d44e68ab194377524e9"},"schema_version":"1.0"},"canonical_sha256":"7579116ba93e051b73e45880af1296f680ae61534ad3c25770d20386e9fc2f5e","source":{"kind":"arxiv","id":"1404.6683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6683","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6683v1","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6683","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"OV4RC25JHYCR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OV4RC25JHYCRW47E","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OV4RC25J","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OV4RC25JHYCRW47ELCAK6EUW62","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-26T21:09:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6dd48f320115baaca9ae54720baf7374e6ec63f5568112941f41906dc9198592","abstract_canon_sha256":"b53267b7cdb138a28362c5cb66cdca65e2bc9a1083ee9d44e68ab194377524e9"},"schema_version":"1.0"},"canonical_sha256":"7579116ba93e051b73e45880af1296f680ae61534ad3c25770d20386e9fc2f5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:06.326767Z","signature_b64":"ZBQx+Kyo07ujnnuW+kH61hPDEETf/PYjm6MiRUD9l+X7QaYXZaaVXCLdRXn4hl4xyXxE6xc18TlgKYs7AvC8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7579116ba93e051b73e45880af1296f680ae61534ad3c25770d20386e9fc2f5e","last_reissued_at":"2026-05-18T02:53:06.326132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:06.326132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6683","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-18T02:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1HkN+tuB8rqFDSw3wzO2w0kuwnkRHBlBdK1DKVHEA4/qucg1l5fdipXT5l9lsusJeDPDTi9iyz9hyoyUUHcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:51:02.097966Z"},"content_sha256":"d38e57b2ff410a4019b44cf29de485530dbf96915fe5241bce3f504c8ab2bf8b","schema_version":"1.0","event_id":"sha256:d38e57b2ff410a4019b44cf29de485530dbf96915fe5241bce3f504c8ab2bf8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OV4RC25JHYCRW47ELCAK6EUW62","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling of Multicast and Unicast Services under Limited Feedback by using Rateless Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"C. Emre Koksal, Kyu-Han Kim, Ness B. Shroff, Yin Sun","submitted_at":"2014-04-26T21:09:26Z","abstract_excerpt":"Many opportunistic scheduling techniques are impractical because they require accurate channel state information (CSI) at the transmitter. In this paper, we investigate the scheduling of unicast and multicast services in a downlink network with a very limited amount of feedback information. Specifically, unicast users send imperfect (or no) CSI and infrequent acknowledgements (ACKs) to a base station, and multicast users only report infrequent ACKs to avoid feedback implosion. We consider the use of physical-layer rateless codes, which not only combats channel uncertainty, but also reduces the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6683","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-18T02:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iI75R5BvB1puhahSk1sTBj04yRGXnTABkbBs4vBLIChxB0FJauIsLRnIeDi8Jg5t4R8Hfy3DcFT0S4ZuPCuODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:51:02.098334Z"},"content_sha256":"89cb5f98f95bef70b2458cb2cbdbd231e9899e7d9349f82b047842d88e5d55fa","schema_version":"1.0","event_id":"sha256:89cb5f98f95bef70b2458cb2cbdbd231e9899e7d9349f82b047842d88e5d55fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OV4RC25JHYCRW47ELCAK6EUW62/bundle.json","state_url":"https://pith.science/pith/OV4RC25JHYCRW47ELCAK6EUW62/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OV4RC25JHYCRW47ELCAK6EUW62/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-20T07:51:02Z","links":{"resolver":"https://pith.science/pith/OV4RC25JHYCRW47ELCAK6EUW62","bundle":"https://pith.science/pith/OV4RC25JHYCRW47ELCAK6EUW62/bundle.json","state":"https://pith.science/pith/OV4RC25JHYCRW47ELCAK6EUW62/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OV4RC25JHYCRW47ELCAK6EUW62/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OV4RC25JHYCRW47ELCAK6EUW62","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":"b53267b7cdb138a28362c5cb66cdca65e2bc9a1083ee9d44e68ab194377524e9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-26T21:09:26Z","title_canon_sha256":"6dd48f320115baaca9ae54720baf7374e6ec63f5568112941f41906dc9198592"},"schema_version":"1.0","source":{"id":"1404.6683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6683","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6683v1","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6683","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"OV4RC25JHYCR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OV4RC25JHYCRW47E","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OV4RC25J","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:89cb5f98f95bef70b2458cb2cbdbd231e9899e7d9349f82b047842d88e5d55fa","target":"graph","created_at":"2026-05-18T02:53:06Z","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":"Many opportunistic scheduling techniques are impractical because they require accurate channel state information (CSI) at the transmitter. In this paper, we investigate the scheduling of unicast and multicast services in a downlink network with a very limited amount of feedback information. Specifically, unicast users send imperfect (or no) CSI and infrequent acknowledgements (ACKs) to a base station, and multicast users only report infrequent ACKs to avoid feedback implosion. We consider the use of physical-layer rateless codes, which not only combats channel uncertainty, but also reduces the","authors_text":"C. Emre Koksal, Kyu-Han Kim, Ness B. Shroff, Yin Sun","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-26T21:09:26Z","title":"Scheduling of Multicast and Unicast Services under Limited Feedback by using Rateless Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6683","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:d38e57b2ff410a4019b44cf29de485530dbf96915fe5241bce3f504c8ab2bf8b","target":"record","created_at":"2026-05-18T02:53:06Z","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":"b53267b7cdb138a28362c5cb66cdca65e2bc9a1083ee9d44e68ab194377524e9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-26T21:09:26Z","title_canon_sha256":"6dd48f320115baaca9ae54720baf7374e6ec63f5568112941f41906dc9198592"},"schema_version":"1.0","source":{"id":"1404.6683","kind":"arxiv","version":1}},"canonical_sha256":"7579116ba93e051b73e45880af1296f680ae61534ad3c25770d20386e9fc2f5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7579116ba93e051b73e45880af1296f680ae61534ad3c25770d20386e9fc2f5e","first_computed_at":"2026-05-18T02:53:06.326132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:06.326132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZBQx+Kyo07ujnnuW+kH61hPDEETf/PYjm6MiRUD9l+X7QaYXZaaVXCLdRXn4hl4xyXxE6xc18TlgKYs7AvC8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:06.326767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d38e57b2ff410a4019b44cf29de485530dbf96915fe5241bce3f504c8ab2bf8b","sha256:89cb5f98f95bef70b2458cb2cbdbd231e9899e7d9349f82b047842d88e5d55fa"],"state_sha256":"79a6d124af39b68a60014edc7a5c924c7005f3dd76f9fcd08343b40504fd24cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CM8SW5PORLsmeeCIJFk8uF5KnFmjb4VF6/TxG0pVqxUG01nQhDayr34XZatfQJF/HrCXLs00POXUFuBxo/8YBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:51:02.101363Z","bundle_sha256":"da6de8580e80233519fa1de32e856062c69fa0b4872c170ccb1baaa26c56cdee"}}