{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:I6GZILDM4QYZVUOXD3C2GBG3DI","short_pith_number":"pith:I6GZILDM","schema_version":"1.0","canonical_sha256":"478d942c6ce4319ad1d71ec5a304db1a268c1efb899d4c2cc84235ea9eaae37b","source":{"kind":"arxiv","id":"1606.04205","version":1},"attestation_state":"computed","paper":{"title":"Robust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation (New Simulation Figures)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chih-Chun Wang, Wei-Cheng Kuo","submitted_at":"2016-06-14T05:11:35Z","abstract_excerpt":"This paper considers the downlink traffic from a base station to two different clients. When assuming infinite backlog, it is known that inter-session network coding (INC) can significantly increase the throughput. However, the corresponding scheduling solution (when assuming dynamic arrivals instead and requiring bounded delay) is still nascent. For the 2-flow downlink scenario, we propose the first opportunistic INC + scheduling solution that is provably optimal for time-varying channels, i.e., the corresponding stability region matches the optimal Shannon capacity. Specifically, we first in"},"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":"1606.04205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-06-14T05:11:35Z","cross_cats_sorted":[],"title_canon_sha256":"4be408be9ae78ac4269919b3191c108940a892bc3177b283a3a4327b0e47c3df","abstract_canon_sha256":"f2bdbf063e94345d97f17e2c2c1377f6eb86c9d14ebcad17c9c2cc1b26fb7eec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:25.967573Z","signature_b64":"sB0gpCbRR9SJQpZCQnTFYh0M4fUpY4f4L8tWEgjZK+O8JLfvC/8cLjAR/ICJNGC/X8CTAtfVooppb1ZqUvFbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"478d942c6ce4319ad1d71ec5a304db1a268c1efb899d4c2cc84235ea9eaae37b","last_reissued_at":"2026-05-18T01:12:25.967229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:25.967229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation (New Simulation Figures)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chih-Chun Wang, Wei-Cheng Kuo","submitted_at":"2016-06-14T05:11:35Z","abstract_excerpt":"This paper considers the downlink traffic from a base station to two different clients. When assuming infinite backlog, it is known that inter-session network coding (INC) can significantly increase the throughput. However, the corresponding scheduling solution (when assuming dynamic arrivals instead and requiring bounded delay) is still nascent. For the 2-flow downlink scenario, we propose the first opportunistic INC + scheduling solution that is provably optimal for time-varying channels, i.e., the corresponding stability region matches the optimal Shannon capacity. Specifically, we first in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04205","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":"1606.04205","created_at":"2026-05-18T01:12:25.967281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04205v1","created_at":"2026-05-18T01:12:25.967281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04205","created_at":"2026-05-18T01:12:25.967281+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6GZILDM4QYZ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6GZILDM4QYZVUOX","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6GZILDM","created_at":"2026-05-18T12:30:22.444734+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/I6GZILDM4QYZVUOXD3C2GBG3DI","json":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI.json","graph_json":"https://pith.science/api/pith-number/I6GZILDM4QYZVUOXD3C2GBG3DI/graph.json","events_json":"https://pith.science/api/pith-number/I6GZILDM4QYZVUOXD3C2GBG3DI/events.json","paper":"https://pith.science/paper/I6GZILDM"},"agent_actions":{"view_html":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI","download_json":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI.json","view_paper":"https://pith.science/paper/I6GZILDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04205&json=true","fetch_graph":"https://pith.science/api/pith-number/I6GZILDM4QYZVUOXD3C2GBG3DI/graph.json","fetch_events":"https://pith.science/api/pith-number/I6GZILDM4QYZVUOXD3C2GBG3DI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI/action/storage_attestation","attest_author":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI/action/author_attestation","sign_citation":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI/action/citation_signature","submit_replication":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI/action/replication_record"}},"created_at":"2026-05-18T01:12:25.967281+00:00","updated_at":"2026-05-18T01:12:25.967281+00:00"}