{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KVRCWAVNSUFSKKFEMRAGGGJQWQ","short_pith_number":"pith:KVRCWAVN","canonical_record":{"source":{"id":"1504.04515","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-17T14:43:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0a6f5e5f7facf08fb8241d19ac0a4fa582793112a5697487a93cd94d8ed182b3","abstract_canon_sha256":"5cec93c5cae6531257b65dd767e1b376dfbf11240b603506f0ae7980e0174509"},"schema_version":"1.0"},"canonical_sha256":"55622b02ad950b2528a46440631930b40d52704070da889556aa40965debbd0a","source":{"kind":"arxiv","id":"1504.04515","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04515","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04515v3","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04515","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"KVRCWAVNSUFS","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KVRCWAVNSUFSKKFE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KVRCWAVN","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KVRCWAVNSUFSKKFEMRAGGGJQWQ","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04515","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-17T14:43:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0a6f5e5f7facf08fb8241d19ac0a4fa582793112a5697487a93cd94d8ed182b3","abstract_canon_sha256":"5cec93c5cae6531257b65dd767e1b376dfbf11240b603506f0ae7980e0174509"},"schema_version":"1.0"},"canonical_sha256":"55622b02ad950b2528a46440631930b40d52704070da889556aa40965debbd0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:35.783946Z","signature_b64":"iw6sZtk+RyLZKz3ShBoN2i/0+Gb4LKHq+v3BYxQW6SJ20J0FvGzAJLzKWMrLFAbUnrVsUJW9XWDe/2kytdA/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55622b02ad950b2528a46440631930b40d52704070da889556aa40965debbd0a","last_reissued_at":"2026-05-18T00:58:35.783276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:35.783276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04515","source_version":3,"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-18T00:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQaWfTUR/2hQnIiG1a12S6DXHHsNZNENIgdOIZpXvHw1CIhX5PFFDLpoV5EI26yGuZU/elfzdmyRjhKfwbhZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:27:42.867921Z"},"content_sha256":"01b53d5c84fa44ef10bd893bac1ede8bf32940debe07201eb1ceb498ff525cba","schema_version":"1.0","event_id":"sha256:01b53d5c84fa44ef10bd893bac1ede8bf32940debe07201eb1ceb498ff525cba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KVRCWAVNSUFSKKFEMRAGGGJQWQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding Schemes for Discrete Memoryless Multicast Networks with Rate-limited Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Youlong Wu","submitted_at":"2015-04-17T14:43:52Z","abstract_excerpt":"Coding schemes for discrete memoryless multicast networks (DM-MN) with rate-limited feedback from the receivers and relays to the transmitter are proposed. The schemes improve over the noisy network coding proposed by Lim et al.. For the single relay channel with relay-transmitter feedback, our coding schemes recover Gabbai and Bross's results, and strictly improve on noisy network coding, distributed decode-forward coding proposed by Lim et al., and all known lower bounds on the achievable rates proposed for the setup without feedback.\n  The coding schemes are based on block-Markov coding, su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04515","kind":"arxiv","version":3},"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-18T00:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1abDyp36zUdAU9f36z66jK9aM8HcfZ4yZ4PUvWcitntPyKZuU3AzoPiENIKpngOFrUeZtIcap/BAyloYvoyXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:27:42.868595Z"},"content_sha256":"ecdb89a7d884ecf26cbce0060f69f85e5550d009c6333b30641fe49d11417985","schema_version":"1.0","event_id":"sha256:ecdb89a7d884ecf26cbce0060f69f85e5550d009c6333b30641fe49d11417985"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVRCWAVNSUFSKKFEMRAGGGJQWQ/bundle.json","state_url":"https://pith.science/pith/KVRCWAVNSUFSKKFEMRAGGGJQWQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVRCWAVNSUFSKKFEMRAGGGJQWQ/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-26T13:27:42Z","links":{"resolver":"https://pith.science/pith/KVRCWAVNSUFSKKFEMRAGGGJQWQ","bundle":"https://pith.science/pith/KVRCWAVNSUFSKKFEMRAGGGJQWQ/bundle.json","state":"https://pith.science/pith/KVRCWAVNSUFSKKFEMRAGGGJQWQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVRCWAVNSUFSKKFEMRAGGGJQWQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KVRCWAVNSUFSKKFEMRAGGGJQWQ","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":"5cec93c5cae6531257b65dd767e1b376dfbf11240b603506f0ae7980e0174509","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-17T14:43:52Z","title_canon_sha256":"0a6f5e5f7facf08fb8241d19ac0a4fa582793112a5697487a93cd94d8ed182b3"},"schema_version":"1.0","source":{"id":"1504.04515","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04515","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04515v3","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04515","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"KVRCWAVNSUFS","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KVRCWAVNSUFSKKFE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KVRCWAVN","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:ecdb89a7d884ecf26cbce0060f69f85e5550d009c6333b30641fe49d11417985","target":"graph","created_at":"2026-05-18T00:58:35Z","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":"Coding schemes for discrete memoryless multicast networks (DM-MN) with rate-limited feedback from the receivers and relays to the transmitter are proposed. The schemes improve over the noisy network coding proposed by Lim et al.. For the single relay channel with relay-transmitter feedback, our coding schemes recover Gabbai and Bross's results, and strictly improve on noisy network coding, distributed decode-forward coding proposed by Lim et al., and all known lower bounds on the achievable rates proposed for the setup without feedback.\n  The coding schemes are based on block-Markov coding, su","authors_text":"Youlong Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-17T14:43:52Z","title":"Coding Schemes for Discrete Memoryless Multicast Networks with Rate-limited Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04515","kind":"arxiv","version":3},"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:01b53d5c84fa44ef10bd893bac1ede8bf32940debe07201eb1ceb498ff525cba","target":"record","created_at":"2026-05-18T00:58:35Z","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":"5cec93c5cae6531257b65dd767e1b376dfbf11240b603506f0ae7980e0174509","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-17T14:43:52Z","title_canon_sha256":"0a6f5e5f7facf08fb8241d19ac0a4fa582793112a5697487a93cd94d8ed182b3"},"schema_version":"1.0","source":{"id":"1504.04515","kind":"arxiv","version":3}},"canonical_sha256":"55622b02ad950b2528a46440631930b40d52704070da889556aa40965debbd0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55622b02ad950b2528a46440631930b40d52704070da889556aa40965debbd0a","first_computed_at":"2026-05-18T00:58:35.783276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:35.783276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iw6sZtk+RyLZKz3ShBoN2i/0+Gb4LKHq+v3BYxQW6SJ20J0FvGzAJLzKWMrLFAbUnrVsUJW9XWDe/2kytdA/BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:35.783946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04515","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01b53d5c84fa44ef10bd893bac1ede8bf32940debe07201eb1ceb498ff525cba","sha256:ecdb89a7d884ecf26cbce0060f69f85e5550d009c6333b30641fe49d11417985"],"state_sha256":"31247404347bd656e618ee8a2b54d8d801b09bc82e57d0ee9f951bfbbedb3723"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TzNt/MXW42S0eb3j4YgnRXfksUD1keGorrOEA+aNOByNeqQ3GqmExWwDI+vJCCs0bzZ8mY7LItVNLiPRvOMBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:27:42.872014Z","bundle_sha256":"1abcd0b04e07599fc3d07677f7b98ab34ce834a7d239ab4cc45192f2f97c1329"}}