{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:66FFHNXFJKEPG4DUKD3AJAJEEA","short_pith_number":"pith:66FFHNXF","schema_version":"1.0","canonical_sha256":"f78a53b6e54a88f3707450f6048124200d6da8c31f54ad9372e1595bcf908346","source":{"kind":"arxiv","id":"1310.7679","version":1},"attestation_state":"computed","paper":{"title":"Structured Optimal Transmission Control in Network-coded Two-way Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.SY","authors_text":"Ni Ding, Parastoo Sadeghi, Rodney A. Kennedy","submitted_at":"2013-10-29T04:17:22Z","abstract_excerpt":"This paper considers a transmission control problem in network-coded two-way relay channels (NC-TWRC), where the relay buffers random symbol arrivals from two users, and the channels are assumed to be fading. The problem is modeled by a discounted infinite horizon Markov decision process (MDP). The objective is to find a transmission control policy that minimizes the symbol delay, buffer overflow and transmission power consumption and error rate simultaneously and in the long run. By using the concepts of submodularity, multimodularity and L-natural convexity, we study the structure of the opt"},"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":"1310.7679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-10-29T04:17:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1e904878019bc13cb9300578f8bd57b97a41240fa93b6cbc8d3bc775af492d38","abstract_canon_sha256":"e71ebc27a98766061661658771dd525e2eada8aeaf830031afd22b358b6a8d38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:35.572433Z","signature_b64":"Xv9tH/HSnUDcxZb6zXTaew+7aNddDY1uWKSXVZ7Su7vlNCVrcM+4bqlReslJkwFCDotJUZwPKN4QxFhjsmHjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f78a53b6e54a88f3707450f6048124200d6da8c31f54ad9372e1595bcf908346","last_reissued_at":"2026-05-18T03:08:35.571848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:35.571848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Optimal Transmission Control in Network-coded Two-way Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.SY","authors_text":"Ni Ding, Parastoo Sadeghi, Rodney A. Kennedy","submitted_at":"2013-10-29T04:17:22Z","abstract_excerpt":"This paper considers a transmission control problem in network-coded two-way relay channels (NC-TWRC), where the relay buffers random symbol arrivals from two users, and the channels are assumed to be fading. The problem is modeled by a discounted infinite horizon Markov decision process (MDP). The objective is to find a transmission control policy that minimizes the symbol delay, buffer overflow and transmission power consumption and error rate simultaneously and in the long run. By using the concepts of submodularity, multimodularity and L-natural convexity, we study the structure of the opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7679","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":"1310.7679","created_at":"2026-05-18T03:08:35.571926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7679v1","created_at":"2026-05-18T03:08:35.571926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7679","created_at":"2026-05-18T03:08:35.571926+00:00"},{"alias_kind":"pith_short_12","alias_value":"66FFHNXFJKEP","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"66FFHNXFJKEPG4DU","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"66FFHNXF","created_at":"2026-05-18T12:27:36.564083+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/66FFHNXFJKEPG4DUKD3AJAJEEA","json":"https://pith.science/pith/66FFHNXFJKEPG4DUKD3AJAJEEA.json","graph_json":"https://pith.science/api/pith-number/66FFHNXFJKEPG4DUKD3AJAJEEA/graph.json","events_json":"https://pith.science/api/pith-number/66FFHNXFJKEPG4DUKD3AJAJEEA/events.json","paper":"https://pith.science/paper/66FFHNXF"},"agent_actions":{"view_html":"https://pith.science/pith/66FFHNXFJKEPG4DUKD3AJAJEEA","download_json":"https://pith.science/pith/66FFHNXFJKEPG4DUKD3AJAJEEA.json","view_paper":"https://pith.science/paper/66FFHNXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7679&json=true","fetch_graph":"https://pith.science/api/pith-number/66FFHNXFJKEPG4DUKD3AJAJEEA/graph.json","fetch_events":"https://pith.science/api/pith-number/66FFHNXFJKEPG4DUKD3AJAJEEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66FFHNXFJKEPG4DUKD3AJAJEEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66FFHNXFJKEPG4DUKD3AJAJEEA/action/storage_attestation","attest_author":"https://pith.science/pith/66FFHNXFJKEPG4DUKD3AJAJEEA/action/author_attestation","sign_citation":"https://pith.science/pith/66FFHNXFJKEPG4DUKD3AJAJEEA/action/citation_signature","submit_replication":"https://pith.science/pith/66FFHNXFJKEPG4DUKD3AJAJEEA/action/replication_record"}},"created_at":"2026-05-18T03:08:35.571926+00:00","updated_at":"2026-05-18T03:08:35.571926+00:00"}