{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7QCCAS7B3APT3HQOYIYCMATHYO","short_pith_number":"pith:7QCCAS7B","schema_version":"1.0","canonical_sha256":"fc04204be1d81f3d9e0ec230260267c38bc5657e3a82f06d7ed21e61a852907d","source":{"kind":"arxiv","id":"1601.06229","version":2},"attestation_state":"computed","paper":{"title":"An Achievable Rate Region for the Two-Way Multiple-Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jonathan Ponniah, Liang-Liang Xie","submitted_at":"2016-01-23T04:28:26Z","abstract_excerpt":"We propose an achievable rate-region for the two-way multiple-relay channel using decode-and-forward block Markovian coding. We identify a conflict between the information flow in both directions. This conflict leads to an intractable number of decode-forward schemes and achievable rate regions, none of which are universally better than the others. We introduce a new concept in decode-forward coding called ranking, and discover that there is an underlying structure to all of these rate regions expressed in the rank assignment. Through this discovery, we characterize the complete achievable rat"},"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":"1601.06229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-23T04:28:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2ca2309baed34ab5f31a30ccca6e72ef1f924ddfcc468c5552c25a37606e7530","abstract_canon_sha256":"85ece865ca9526b648644c36876410af95d820bb6f5d0433f87b9c6c234326af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:38.029416Z","signature_b64":"FcbZgNoJopTLZwtTDeg/SJ/xoQMdO8ZivrmsVopgIUeGQIc/N+/tUNp2gqksyZm0FdEW980zsB/BJSzfnCgMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc04204be1d81f3d9e0ec230260267c38bc5657e3a82f06d7ed21e61a852907d","last_reissued_at":"2026-05-18T01:10:38.028892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:38.028892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Achievable Rate Region for the Two-Way Multiple-Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jonathan Ponniah, Liang-Liang Xie","submitted_at":"2016-01-23T04:28:26Z","abstract_excerpt":"We propose an achievable rate-region for the two-way multiple-relay channel using decode-and-forward block Markovian coding. We identify a conflict between the information flow in both directions. This conflict leads to an intractable number of decode-forward schemes and achievable rate regions, none of which are universally better than the others. We introduce a new concept in decode-forward coding called ranking, and discover that there is an underlying structure to all of these rate regions expressed in the rank assignment. Through this discovery, we characterize the complete achievable rat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06229","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.06229","created_at":"2026-05-18T01:10:38.028966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06229v2","created_at":"2026-05-18T01:10:38.028966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06229","created_at":"2026-05-18T01:10:38.028966+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QCCAS7B3APT","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QCCAS7B3APT3HQO","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QCCAS7B","created_at":"2026-05-18T12:30:04.600751+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/7QCCAS7B3APT3HQOYIYCMATHYO","json":"https://pith.science/pith/7QCCAS7B3APT3HQOYIYCMATHYO.json","graph_json":"https://pith.science/api/pith-number/7QCCAS7B3APT3HQOYIYCMATHYO/graph.json","events_json":"https://pith.science/api/pith-number/7QCCAS7B3APT3HQOYIYCMATHYO/events.json","paper":"https://pith.science/paper/7QCCAS7B"},"agent_actions":{"view_html":"https://pith.science/pith/7QCCAS7B3APT3HQOYIYCMATHYO","download_json":"https://pith.science/pith/7QCCAS7B3APT3HQOYIYCMATHYO.json","view_paper":"https://pith.science/paper/7QCCAS7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06229&json=true","fetch_graph":"https://pith.science/api/pith-number/7QCCAS7B3APT3HQOYIYCMATHYO/graph.json","fetch_events":"https://pith.science/api/pith-number/7QCCAS7B3APT3HQOYIYCMATHYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QCCAS7B3APT3HQOYIYCMATHYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QCCAS7B3APT3HQOYIYCMATHYO/action/storage_attestation","attest_author":"https://pith.science/pith/7QCCAS7B3APT3HQOYIYCMATHYO/action/author_attestation","sign_citation":"https://pith.science/pith/7QCCAS7B3APT3HQOYIYCMATHYO/action/citation_signature","submit_replication":"https://pith.science/pith/7QCCAS7B3APT3HQOYIYCMATHYO/action/replication_record"}},"created_at":"2026-05-18T01:10:38.028966+00:00","updated_at":"2026-05-18T01:10:38.028966+00:00"}