{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:I6GZILDM4QYZVUOXD3C2GBG3DI","short_pith_number":"pith:I6GZILDM","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"},"canonical_sha256":"478d942c6ce4319ad1d71ec5a304db1a268c1efb899d4c2cc84235ea9eaae37b","source":{"kind":"arxiv","id":"1606.04205","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04205","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04205v1","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04205","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"I6GZILDM4QYZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I6GZILDM4QYZVUOX","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I6GZILDM","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:I6GZILDM4QYZVUOXD3C2GBG3DI","target":"record","payload":{"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"},"canonical_sha256":"478d942c6ce4319ad1d71ec5a304db1a268c1efb899d4c2cc84235ea9eaae37b","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"},"source_kind":"arxiv","source_id":"1606.04205","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:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"75+XQfVFJhRXlqsFR1rKNTTPsuS1MfBZIJoYPwAfiFVQiACdBF6ltr50UvAbFFWaz6ga2TTqUzEjJHKY/27aCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:20:36.038448Z"},"content_sha256":"e91dee6a429ba4fff487eea37e23aee3eca64a939d0b531851fb48626ed6b60b","schema_version":"1.0","event_id":"sha256:e91dee6a429ba4fff487eea37e23aee3eca64a939d0b531851fb48626ed6b60b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:I6GZILDM4QYZVUOXD3C2GBG3DI","target":"graph","payload":{"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"},"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:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yx/CRJnuDqSyvdgLwkSO/db2hGlJorND7c13tIGkbmS98J9U/4tZIs0ymwjoHYrTRNN3b9aKGr5UCn/jRfOfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:20:36.039088Z"},"content_sha256":"46e41287320b05ddaf5933971df233da51a1d3eb4bc0c724a2fcb6fe95755824","schema_version":"1.0","event_id":"sha256:46e41287320b05ddaf5933971df233da51a1d3eb4bc0c724a2fcb6fe95755824"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI/bundle.json","state_url":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6GZILDM4QYZVUOXD3C2GBG3DI/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-05-31T03:20:36Z","links":{"resolver":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI","bundle":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI/bundle.json","state":"https://pith.science/pith/I6GZILDM4QYZVUOXD3C2GBG3DI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6GZILDM4QYZVUOXD3C2GBG3DI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:I6GZILDM4QYZVUOXD3C2GBG3DI","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":"f2bdbf063e94345d97f17e2c2c1377f6eb86c9d14ebcad17c9c2cc1b26fb7eec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-06-14T05:11:35Z","title_canon_sha256":"4be408be9ae78ac4269919b3191c108940a892bc3177b283a3a4327b0e47c3df"},"schema_version":"1.0","source":{"id":"1606.04205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04205","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04205v1","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04205","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"I6GZILDM4QYZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I6GZILDM4QYZVUOX","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I6GZILDM","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:46e41287320b05ddaf5933971df233da51a1d3eb4bc0c724a2fcb6fe95755824","target":"graph","created_at":"2026-05-18T01:12:25Z","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":"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","authors_text":"Chih-Chun Wang, Wei-Cheng Kuo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-06-14T05:11:35Z","title":"Robust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation (New Simulation Figures)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04205","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:e91dee6a429ba4fff487eea37e23aee3eca64a939d0b531851fb48626ed6b60b","target":"record","created_at":"2026-05-18T01:12:25Z","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":"f2bdbf063e94345d97f17e2c2c1377f6eb86c9d14ebcad17c9c2cc1b26fb7eec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-06-14T05:11:35Z","title_canon_sha256":"4be408be9ae78ac4269919b3191c108940a892bc3177b283a3a4327b0e47c3df"},"schema_version":"1.0","source":{"id":"1606.04205","kind":"arxiv","version":1}},"canonical_sha256":"478d942c6ce4319ad1d71ec5a304db1a268c1efb899d4c2cc84235ea9eaae37b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"478d942c6ce4319ad1d71ec5a304db1a268c1efb899d4c2cc84235ea9eaae37b","first_computed_at":"2026-05-18T01:12:25.967229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:25.967229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sB0gpCbRR9SJQpZCQnTFYh0M4fUpY4f4L8tWEgjZK+O8JLfvC/8cLjAR/ICJNGC/X8CTAtfVooppb1ZqUvFbBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:25.967573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e91dee6a429ba4fff487eea37e23aee3eca64a939d0b531851fb48626ed6b60b","sha256:46e41287320b05ddaf5933971df233da51a1d3eb4bc0c724a2fcb6fe95755824"],"state_sha256":"0b1041f59ff30c59c0cba05de5c0a894453b5e1c2c7b8ab625cb989afc8576fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"srQlOTar+72DJRvmdf/upGhVMYtaDfsGKAV1Jh0Coz7fDdXT+oUW2DAf+5qND/8uHrP75rEpz2VwoN6quUlOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:20:36.042522Z","bundle_sha256":"cd5e827e3b3322c44c207eb92b16ff466445a2290daa424a15cae810a6165e99"}}