{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RTIY4OLK6ZBWJVOLVW7PT6NEJP","short_pith_number":"pith:RTIY4OLK","schema_version":"1.0","canonical_sha256":"8cd18e396af64364d5cbadbef9f9a44bfd7af376c0201a150023fae146645987","source":{"kind":"arxiv","id":"1107.1886","version":1},"attestation_state":"computed","paper":{"title":"Utility Optimal Coding for Packet Transmission over Wireless Networks - Part I: Networks of Binary Symmetric Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Douglas J. Leith, Premkumar Karumbu, Xiaomin Chen","submitted_at":"2011-07-10T19:29:43Z","abstract_excerpt":"We consider multi--hop networks comprising Binary Symmetric Channels ($\\mathsf{BSC}$s). The network carries unicast flows for multiple users. The utility of the network is the sum of the utilities of the flows, where the utility of each flow is a concave function of its throughput. Given that the network capacity is shared by the flows, there is a contention for network resources like coding rate (at the physical layer), scheduling time (at the MAC layer), etc., among the flows. We propose a proportional fair transmission scheme that maximises the sum utility of flow throughputs subject to the"},"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":"1107.1886","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-10T19:29:43Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"1f9311baa6211fc72ce45df06cfe0e6cfa6ce9f0f7df6dcd01bd84d7fb46bc7f","abstract_canon_sha256":"783b7b269f597f61be37a10a169314d2ee7e97f0036975821b2b2a4c5ec60fcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:43.029849Z","signature_b64":"Yl7EebNc3LQiW46/SherKbFSPdWPLeBYwX4p/nVliAUK4FEJBzeroPbrpQMX1dkIA65u2m6E3Fo+1l7lcUfKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cd18e396af64364d5cbadbef9f9a44bfd7af376c0201a150023fae146645987","last_reissued_at":"2026-05-18T02:21:43.029373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:43.029373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Utility Optimal Coding for Packet Transmission over Wireless Networks - Part I: Networks of Binary Symmetric Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Douglas J. Leith, Premkumar Karumbu, Xiaomin Chen","submitted_at":"2011-07-10T19:29:43Z","abstract_excerpt":"We consider multi--hop networks comprising Binary Symmetric Channels ($\\mathsf{BSC}$s). The network carries unicast flows for multiple users. The utility of the network is the sum of the utilities of the flows, where the utility of each flow is a concave function of its throughput. Given that the network capacity is shared by the flows, there is a contention for network resources like coding rate (at the physical layer), scheduling time (at the MAC layer), etc., among the flows. We propose a proportional fair transmission scheme that maximises the sum utility of flow throughputs subject to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1886","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":"1107.1886","created_at":"2026-05-18T02:21:43.029453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1886v1","created_at":"2026-05-18T02:21:43.029453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1886","created_at":"2026-05-18T02:21:43.029453+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTIY4OLK6ZBW","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTIY4OLK6ZBWJVOL","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTIY4OLK","created_at":"2026-05-18T12:26:41.206345+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/RTIY4OLK6ZBWJVOLVW7PT6NEJP","json":"https://pith.science/pith/RTIY4OLK6ZBWJVOLVW7PT6NEJP.json","graph_json":"https://pith.science/api/pith-number/RTIY4OLK6ZBWJVOLVW7PT6NEJP/graph.json","events_json":"https://pith.science/api/pith-number/RTIY4OLK6ZBWJVOLVW7PT6NEJP/events.json","paper":"https://pith.science/paper/RTIY4OLK"},"agent_actions":{"view_html":"https://pith.science/pith/RTIY4OLK6ZBWJVOLVW7PT6NEJP","download_json":"https://pith.science/pith/RTIY4OLK6ZBWJVOLVW7PT6NEJP.json","view_paper":"https://pith.science/paper/RTIY4OLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1886&json=true","fetch_graph":"https://pith.science/api/pith-number/RTIY4OLK6ZBWJVOLVW7PT6NEJP/graph.json","fetch_events":"https://pith.science/api/pith-number/RTIY4OLK6ZBWJVOLVW7PT6NEJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTIY4OLK6ZBWJVOLVW7PT6NEJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTIY4OLK6ZBWJVOLVW7PT6NEJP/action/storage_attestation","attest_author":"https://pith.science/pith/RTIY4OLK6ZBWJVOLVW7PT6NEJP/action/author_attestation","sign_citation":"https://pith.science/pith/RTIY4OLK6ZBWJVOLVW7PT6NEJP/action/citation_signature","submit_replication":"https://pith.science/pith/RTIY4OLK6ZBWJVOLVW7PT6NEJP/action/replication_record"}},"created_at":"2026-05-18T02:21:43.029453+00:00","updated_at":"2026-05-18T02:21:43.029453+00:00"}