{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:75SAQWCCL3N232UTMMR6OV3SK3","short_pith_number":"pith:75SAQWCC","schema_version":"1.0","canonical_sha256":"ff640858425edbadea936323e7577256fa1fc806d54aba1709869fcfcea6375a","source":{"kind":"arxiv","id":"1207.3850","version":1},"attestation_state":"computed","paper":{"title":"On Capacity and Optimal Scheduling for the Half-Duplex Multiple-Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lawrence Ong, Mehul Motani, Sarah J. Johnson","submitted_at":"2012-07-17T00:48:06Z","abstract_excerpt":"We study the half-duplex multiple-relay channel (HD-MRC) where every node can either transmit or listen but cannot do both at the same time. We obtain a capacity upper bound based on a max-flow min-cut argument and achievable transmission rates based on the decode-forward (DF) coding strategy, for both the discrete memoryless HD-MRC and the phase-fading HD-MRC. We discover that both the upper bound and the achievable rates are functions of the transmit/listen state (a description of which nodes transmit and which receive). More precisely, they are functions of the time fraction of the differen"},"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":"1207.3850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-17T00:48:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"80cbb9a12eaa16fdf438b7eecb6b5c76ef59e86938770397372c9bc93a8961e6","abstract_canon_sha256":"20fd4eb248fbe8259aba2c58c3b2b8112b9df4f0a813de6f871f5cf6cded079f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:28.351555Z","signature_b64":"QrE85CXeLLZzUVRyqrFDEPjlffWGW/wOlM1krkQ2FmwZCKu25S5vwDuK0XOdbPSc3x3oN29qKWO8o84aVOtSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff640858425edbadea936323e7577256fa1fc806d54aba1709869fcfcea6375a","last_reissued_at":"2026-05-18T03:39:28.350843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:28.350843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Capacity and Optimal Scheduling for the Half-Duplex Multiple-Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lawrence Ong, Mehul Motani, Sarah J. Johnson","submitted_at":"2012-07-17T00:48:06Z","abstract_excerpt":"We study the half-duplex multiple-relay channel (HD-MRC) where every node can either transmit or listen but cannot do both at the same time. We obtain a capacity upper bound based on a max-flow min-cut argument and achievable transmission rates based on the decode-forward (DF) coding strategy, for both the discrete memoryless HD-MRC and the phase-fading HD-MRC. We discover that both the upper bound and the achievable rates are functions of the transmit/listen state (a description of which nodes transmit and which receive). More precisely, they are functions of the time fraction of the differen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3850","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":"1207.3850","created_at":"2026-05-18T03:39:28.350961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3850v1","created_at":"2026-05-18T03:39:28.350961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3850","created_at":"2026-05-18T03:39:28.350961+00:00"},{"alias_kind":"pith_short_12","alias_value":"75SAQWCCL3N2","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"75SAQWCCL3N232UT","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"75SAQWCC","created_at":"2026-05-18T12:26:56.085431+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/75SAQWCCL3N232UTMMR6OV3SK3","json":"https://pith.science/pith/75SAQWCCL3N232UTMMR6OV3SK3.json","graph_json":"https://pith.science/api/pith-number/75SAQWCCL3N232UTMMR6OV3SK3/graph.json","events_json":"https://pith.science/api/pith-number/75SAQWCCL3N232UTMMR6OV3SK3/events.json","paper":"https://pith.science/paper/75SAQWCC"},"agent_actions":{"view_html":"https://pith.science/pith/75SAQWCCL3N232UTMMR6OV3SK3","download_json":"https://pith.science/pith/75SAQWCCL3N232UTMMR6OV3SK3.json","view_paper":"https://pith.science/paper/75SAQWCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3850&json=true","fetch_graph":"https://pith.science/api/pith-number/75SAQWCCL3N232UTMMR6OV3SK3/graph.json","fetch_events":"https://pith.science/api/pith-number/75SAQWCCL3N232UTMMR6OV3SK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75SAQWCCL3N232UTMMR6OV3SK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75SAQWCCL3N232UTMMR6OV3SK3/action/storage_attestation","attest_author":"https://pith.science/pith/75SAQWCCL3N232UTMMR6OV3SK3/action/author_attestation","sign_citation":"https://pith.science/pith/75SAQWCCL3N232UTMMR6OV3SK3/action/citation_signature","submit_replication":"https://pith.science/pith/75SAQWCCL3N232UTMMR6OV3SK3/action/replication_record"}},"created_at":"2026-05-18T03:39:28.350961+00:00","updated_at":"2026-05-18T03:39:28.350961+00:00"}