{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UYJ4FAOPYLRH727AE24A73HRPG","short_pith_number":"pith:UYJ4FAOP","canonical_record":{"source":{"id":"1304.1692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-05T12:26:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d7e66afb164b1aad3498c45925babf4fce567a509b90766bccb4c49ac93bbf9b","abstract_canon_sha256":"4baa833b950742258189fe93a3e2dcbe2d59be5e4fd729ab9f58e0800feb59ec"},"schema_version":"1.0"},"canonical_sha256":"a613c281cfc2e27febe026b80fecf179bc5fe879acbc43ba63a489db89d53881","source":{"kind":"arxiv","id":"1304.1692","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1692","created_at":"2026-05-18T03:16:16Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1692v2","created_at":"2026-05-18T03:16:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1692","created_at":"2026-05-18T03:16:16Z"},{"alias_kind":"pith_short_12","alias_value":"UYJ4FAOPYLRH","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UYJ4FAOPYLRH727A","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UYJ4FAOP","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UYJ4FAOPYLRH727AE24A73HRPG","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-05T12:26:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d7e66afb164b1aad3498c45925babf4fce567a509b90766bccb4c49ac93bbf9b","abstract_canon_sha256":"4baa833b950742258189fe93a3e2dcbe2d59be5e4fd729ab9f58e0800feb59ec"},"schema_version":"1.0"},"canonical_sha256":"a613c281cfc2e27febe026b80fecf179bc5fe879acbc43ba63a489db89d53881","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:16.608363Z","signature_b64":"RGCj++v65aqoszKq8KJgj2HDa5eSnBx2GiwyC11ry3iMHg9WdjqlHKSCebsD2trZs7S0o8fdvSTPVaRNo5PJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a613c281cfc2e27febe026b80fecf179bc5fe879acbc43ba63a489db89d53881","last_reissued_at":"2026-05-18T03:16:16.607639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:16.607639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1692","source_version":2,"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-18T03:16:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/W25SjzwgQM7uBwWz9edOsUaz76RF6f5cic0uo9XNOCYYlkKVTWY5ZArn3OpdnSoEwAGmw5wFH6EyKb8b8UgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:28:09.369210Z"},"content_sha256":"7764dfa8166285f54868357584162e2dcbe24a768a5d258740f7fcebef2d4c3a","schema_version":"1.0","event_id":"sha256:7764dfa8166285f54868357584162e2dcbe24a768a5d258740f7fcebef2d4c3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UYJ4FAOPYLRH727AE24A73HRPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Short Message Noisy Network Coding with a Decode-Forward Option","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerhard Kramer, Jie Hou","submitted_at":"2013-04-05T12:26:19Z","abstract_excerpt":"Short message noisy network coding (SNNC) differs from long message noisy network coding (LNNC) in that one transmits many short messages in blocks rather than using one long message with repetitive encoding. Several properties of SNNC are developed. First, SNNC with backward decoding achieves the same rates as SNNC with offset encoding and sliding window decoding for memoryless networks where each node transmits a multicast message. The rates are the same as LNNC with joint decoding. Second, SNNC enables early decoding if the channel quality happens to be good. This leads to mixed strategies "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1692","kind":"arxiv","version":2},"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-18T03:16:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEBXmV+MOBdJRcMJ+7mviX+O374EncIoIq5SD2kw5MtNhVECfmHVzRbz86QKuQ2n/PK4ANT8R3KA7S2312z/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:28:09.369572Z"},"content_sha256":"6172d88548c0904ce7e6820867155e39849ce0263d2dcbaaccb9cee551f356a9","schema_version":"1.0","event_id":"sha256:6172d88548c0904ce7e6820867155e39849ce0263d2dcbaaccb9cee551f356a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UYJ4FAOPYLRH727AE24A73HRPG/bundle.json","state_url":"https://pith.science/pith/UYJ4FAOPYLRH727AE24A73HRPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UYJ4FAOPYLRH727AE24A73HRPG/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-05T02:28:09Z","links":{"resolver":"https://pith.science/pith/UYJ4FAOPYLRH727AE24A73HRPG","bundle":"https://pith.science/pith/UYJ4FAOPYLRH727AE24A73HRPG/bundle.json","state":"https://pith.science/pith/UYJ4FAOPYLRH727AE24A73HRPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UYJ4FAOPYLRH727AE24A73HRPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UYJ4FAOPYLRH727AE24A73HRPG","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":"4baa833b950742258189fe93a3e2dcbe2d59be5e4fd729ab9f58e0800feb59ec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-05T12:26:19Z","title_canon_sha256":"d7e66afb164b1aad3498c45925babf4fce567a509b90766bccb4c49ac93bbf9b"},"schema_version":"1.0","source":{"id":"1304.1692","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1692","created_at":"2026-05-18T03:16:16Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1692v2","created_at":"2026-05-18T03:16:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1692","created_at":"2026-05-18T03:16:16Z"},{"alias_kind":"pith_short_12","alias_value":"UYJ4FAOPYLRH","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UYJ4FAOPYLRH727A","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UYJ4FAOP","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:6172d88548c0904ce7e6820867155e39849ce0263d2dcbaaccb9cee551f356a9","target":"graph","created_at":"2026-05-18T03:16:16Z","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":"Short message noisy network coding (SNNC) differs from long message noisy network coding (LNNC) in that one transmits many short messages in blocks rather than using one long message with repetitive encoding. Several properties of SNNC are developed. First, SNNC with backward decoding achieves the same rates as SNNC with offset encoding and sliding window decoding for memoryless networks where each node transmits a multicast message. The rates are the same as LNNC with joint decoding. Second, SNNC enables early decoding if the channel quality happens to be good. This leads to mixed strategies ","authors_text":"Gerhard Kramer, Jie Hou","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-05T12:26:19Z","title":"Short Message Noisy Network Coding with a Decode-Forward Option"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1692","kind":"arxiv","version":2},"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:7764dfa8166285f54868357584162e2dcbe24a768a5d258740f7fcebef2d4c3a","target":"record","created_at":"2026-05-18T03:16:16Z","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":"4baa833b950742258189fe93a3e2dcbe2d59be5e4fd729ab9f58e0800feb59ec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-05T12:26:19Z","title_canon_sha256":"d7e66afb164b1aad3498c45925babf4fce567a509b90766bccb4c49ac93bbf9b"},"schema_version":"1.0","source":{"id":"1304.1692","kind":"arxiv","version":2}},"canonical_sha256":"a613c281cfc2e27febe026b80fecf179bc5fe879acbc43ba63a489db89d53881","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a613c281cfc2e27febe026b80fecf179bc5fe879acbc43ba63a489db89d53881","first_computed_at":"2026-05-18T03:16:16.607639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:16.607639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RGCj++v65aqoszKq8KJgj2HDa5eSnBx2GiwyC11ry3iMHg9WdjqlHKSCebsD2trZs7S0o8fdvSTPVaRNo5PJCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:16.608363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1692","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7764dfa8166285f54868357584162e2dcbe24a768a5d258740f7fcebef2d4c3a","sha256:6172d88548c0904ce7e6820867155e39849ce0263d2dcbaaccb9cee551f356a9"],"state_sha256":"dc91db8c9cfa04b882639c1a92f504ccdb22ce0187cb79bde432d02b832694c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g+SIyIDK53Ful5YCh6JUXMJtnyxBRKXUHRsQjv6J3dA9+yIHp0Cm0Y/CD9E3AlyAL5eKpfEChe8WX+aInBz9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:28:09.371626Z","bundle_sha256":"2cdbaef589c2156652574cd6fa175aba7ffa9ec132bd58c83b664d85880c718c"}}