{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CRPH4IY47C4ZMLQBG6QLOLBQO7","short_pith_number":"pith:CRPH4IY4","canonical_record":{"source":{"id":"1303.6919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-27T18:17:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6f635c9de670a369ecb0cfab157566fb0df5faa62cd8571bce674447d5bd303b","abstract_canon_sha256":"f00f3939e158f69cf4041804d30ef4f47285ae79e0ea503575e2af40d5dcb5a3"},"schema_version":"1.0"},"canonical_sha256":"145e7e231cf8b9962e0137a0b72c3077e23bfd534968beabe117dee08b355ca8","source":{"kind":"arxiv","id":"1303.6919","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6919","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6919v1","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6919","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"CRPH4IY47C4Z","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CRPH4IY47C4ZMLQB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CRPH4IY4","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CRPH4IY47C4ZMLQBG6QLOLBQO7","target":"record","payload":{"canonical_record":{"source":{"id":"1303.6919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-27T18:17:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6f635c9de670a369ecb0cfab157566fb0df5faa62cd8571bce674447d5bd303b","abstract_canon_sha256":"f00f3939e158f69cf4041804d30ef4f47285ae79e0ea503575e2af40d5dcb5a3"},"schema_version":"1.0"},"canonical_sha256":"145e7e231cf8b9962e0137a0b72c3077e23bfd534968beabe117dee08b355ca8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:39.327847Z","signature_b64":"Yr6jTXgOJi6q0ZOw57+rDX3Wx6U3FNyE1yQgzZ80Y8aFfTsfSsZfhjnLiMB+X9HIv0/mLycpiqX8gvOUNOCTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"145e7e231cf8b9962e0137a0b72c3077e23bfd534968beabe117dee08b355ca8","last_reissued_at":"2026-05-18T03:29:39.327028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:39.327028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.6919","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-18T03:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"keiUrQGRvmLm6PK57mO3ymKhdELRZGtwQ8A1NrsxFE307I/HMnX0Wohl64yKsZgbG0tC6tY2FI6RpMarnpDHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:28:20.780371Z"},"content_sha256":"f2591c9187ff447d281f64d6292be662695f95562e1543c5de7ed164bd7112ed","schema_version":"1.0","event_id":"sha256:f2591c9187ff447d281f64d6292be662695f95562e1543c5de7ed164bd7112ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CRPH4IY47C4ZMLQBG6QLOLBQO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Partial Decode-Forward Scheme For A Network with N relays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mai Vu, Yao Tang","submitted_at":"2013-03-27T18:17:31Z","abstract_excerpt":"We study a discrete-memoryless relay network consisting of one source, one destination and N relays, and design a scheme based on partial decode-forward relaying. The source splits its message into one common and N+1 private parts, one intended for each relay. It encodes these message parts using Nth-order block Markov coding, in which each private message part is independently superimposed on the common parts of the current and N previous blocks. Using simultaneous sliding window decoding, each relay fully recovers the common message and its intended private message with the same block index,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6919","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-18T03:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghOPzNajtSb4EwcYWgei1K4liRiToyRvsF/k7hbZyjWned+nEv9pinogVpA6aRl55wcCnC/HBwsVVsdcu7FTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:28:20.780734Z"},"content_sha256":"629afcc5c4d6e533fb5ece37ff348d12087e442b55a819fa35b7e38e0a81fa0b","schema_version":"1.0","event_id":"sha256:629afcc5c4d6e533fb5ece37ff348d12087e442b55a819fa35b7e38e0a81fa0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7/bundle.json","state_url":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7/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-03T04:28:20Z","links":{"resolver":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7","bundle":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7/bundle.json","state":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CRPH4IY47C4ZMLQBG6QLOLBQO7","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":"f00f3939e158f69cf4041804d30ef4f47285ae79e0ea503575e2af40d5dcb5a3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-27T18:17:31Z","title_canon_sha256":"6f635c9de670a369ecb0cfab157566fb0df5faa62cd8571bce674447d5bd303b"},"schema_version":"1.0","source":{"id":"1303.6919","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6919","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6919v1","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6919","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"CRPH4IY47C4Z","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CRPH4IY47C4ZMLQB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CRPH4IY4","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:629afcc5c4d6e533fb5ece37ff348d12087e442b55a819fa35b7e38e0a81fa0b","target":"graph","created_at":"2026-05-18T03:29:39Z","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":"We study a discrete-memoryless relay network consisting of one source, one destination and N relays, and design a scheme based on partial decode-forward relaying. The source splits its message into one common and N+1 private parts, one intended for each relay. It encodes these message parts using Nth-order block Markov coding, in which each private message part is independently superimposed on the common parts of the current and N previous blocks. Using simultaneous sliding window decoding, each relay fully recovers the common message and its intended private message with the same block index,","authors_text":"Mai Vu, Yao Tang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-27T18:17:31Z","title":"A Partial Decode-Forward Scheme For A Network with N relays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6919","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:f2591c9187ff447d281f64d6292be662695f95562e1543c5de7ed164bd7112ed","target":"record","created_at":"2026-05-18T03:29:39Z","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":"f00f3939e158f69cf4041804d30ef4f47285ae79e0ea503575e2af40d5dcb5a3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-27T18:17:31Z","title_canon_sha256":"6f635c9de670a369ecb0cfab157566fb0df5faa62cd8571bce674447d5bd303b"},"schema_version":"1.0","source":{"id":"1303.6919","kind":"arxiv","version":1}},"canonical_sha256":"145e7e231cf8b9962e0137a0b72c3077e23bfd534968beabe117dee08b355ca8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"145e7e231cf8b9962e0137a0b72c3077e23bfd534968beabe117dee08b355ca8","first_computed_at":"2026-05-18T03:29:39.327028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:39.327028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yr6jTXgOJi6q0ZOw57+rDX3Wx6U3FNyE1yQgzZ80Y8aFfTsfSsZfhjnLiMB+X9HIv0/mLycpiqX8gvOUNOCTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:39.327847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6919","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2591c9187ff447d281f64d6292be662695f95562e1543c5de7ed164bd7112ed","sha256:629afcc5c4d6e533fb5ece37ff348d12087e442b55a819fa35b7e38e0a81fa0b"],"state_sha256":"6d9623d5e1d9a87d5b01d0476a578db5e1ba6a285f3eb68db38dda11f9d37871"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iarrtsy9503Fn2VZrXNc6n6JY+IqJIklwUAAAjj0CMZ7YvbCbBou5kLpHpPw1IDXIkRlVVNgP9iPtgChp/gwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:28:20.782778Z","bundle_sha256":"3d896b64a3a4c892984d4a66ac3d43c9f82259fb44e144d42b9b03ba9158c1ce"}}