{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CRPH4IY47C4ZMLQBG6QLOLBQO7","short_pith_number":"pith:CRPH4IY4","schema_version":"1.0","canonical_sha256":"145e7e231cf8b9962e0137a0b72c3077e23bfd534968beabe117dee08b355ca8","source":{"kind":"arxiv","id":"1303.6919","version":1},"attestation_state":"computed","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,"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.6919","created_at":"2026-05-18T03:29:39.327168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.6919v1","created_at":"2026-05-18T03:29:39.327168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6919","created_at":"2026-05-18T03:29:39.327168+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRPH4IY47C4Z","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRPH4IY47C4ZMLQB","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRPH4IY4","created_at":"2026-05-18T12:27:40.988391+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/CRPH4IY47C4ZMLQBG6QLOLBQO7","json":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7.json","graph_json":"https://pith.science/api/pith-number/CRPH4IY47C4ZMLQBG6QLOLBQO7/graph.json","events_json":"https://pith.science/api/pith-number/CRPH4IY47C4ZMLQBG6QLOLBQO7/events.json","paper":"https://pith.science/paper/CRPH4IY4"},"agent_actions":{"view_html":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7","download_json":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7.json","view_paper":"https://pith.science/paper/CRPH4IY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.6919&json=true","fetch_graph":"https://pith.science/api/pith-number/CRPH4IY47C4ZMLQBG6QLOLBQO7/graph.json","fetch_events":"https://pith.science/api/pith-number/CRPH4IY47C4ZMLQBG6QLOLBQO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7/action/storage_attestation","attest_author":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7/action/author_attestation","sign_citation":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7/action/citation_signature","submit_replication":"https://pith.science/pith/CRPH4IY47C4ZMLQBG6QLOLBQO7/action/replication_record"}},"created_at":"2026-05-18T03:29:39.327168+00:00","updated_at":"2026-05-18T03:29:39.327168+00:00"}