{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:J3U4PDXJ2BQJQET4KKPP4G43YH","short_pith_number":"pith:J3U4PDXJ","schema_version":"1.0","canonical_sha256":"4ee9c78ee9d06098127c529efe1b9bc1c0c433e1637fd7124c5efa0a19f9c258","source":{"kind":"arxiv","id":"1107.1890","version":1},"attestation_state":"computed","paper":{"title":"Utility Optimal Coding for Packet Transmission over Wireless Networks - Part II: Networks of Packet Erasure 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:51:52Z","abstract_excerpt":"We define a class of multi--hop erasure networks that approximates a wireless multi--hop network. The network carries unicast flows for multiple users, and each information packet within a flow is required to be decoded at the flow destination within a specified delay deadline. The allocation of coding rates amongst flows/users is constrained by network capacity. We propose a proportional fair transmission scheme that maximises the sum utility of flow throughputs. This is achieved by {\\em jointly optimising the packet coding rates and the allocation of bits of coded packets across transmission"},"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.1890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-10T19:51:52Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"649a04bf79e9772c52734bc9a2bfe13baa5518cc9ba688948dcaf45c9a2e8a4a","abstract_canon_sha256":"6b854f8e69ebff01d0bfd76a02c13d17457822a5d5042e15e0e4b9f1cbc8c3ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:43.022830Z","signature_b64":"WoqFglEmNCS4B8nbYUEBMJ0gxqjS7BmgVZa294IFZpZZAN5VilozcPcVgkCeYkV+sUMp6S1kprYp3T/rhBO1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ee9c78ee9d06098127c529efe1b9bc1c0c433e1637fd7124c5efa0a19f9c258","last_reissued_at":"2026-05-18T02:21:43.022346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:43.022346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Utility Optimal Coding for Packet Transmission over Wireless Networks - Part II: Networks of Packet Erasure 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:51:52Z","abstract_excerpt":"We define a class of multi--hop erasure networks that approximates a wireless multi--hop network. The network carries unicast flows for multiple users, and each information packet within a flow is required to be decoded at the flow destination within a specified delay deadline. The allocation of coding rates amongst flows/users is constrained by network capacity. We propose a proportional fair transmission scheme that maximises the sum utility of flow throughputs. This is achieved by {\\em jointly optimising the packet coding rates and the allocation of bits of coded packets across transmission"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1890","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.1890","created_at":"2026-05-18T02:21:43.022421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1890v1","created_at":"2026-05-18T02:21:43.022421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1890","created_at":"2026-05-18T02:21:43.022421+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3U4PDXJ2BQJ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3U4PDXJ2BQJQET4","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3U4PDXJ","created_at":"2026-05-18T12:26:32.869790+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/J3U4PDXJ2BQJQET4KKPP4G43YH","json":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH.json","graph_json":"https://pith.science/api/pith-number/J3U4PDXJ2BQJQET4KKPP4G43YH/graph.json","events_json":"https://pith.science/api/pith-number/J3U4PDXJ2BQJQET4KKPP4G43YH/events.json","paper":"https://pith.science/paper/J3U4PDXJ"},"agent_actions":{"view_html":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH","download_json":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH.json","view_paper":"https://pith.science/paper/J3U4PDXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1890&json=true","fetch_graph":"https://pith.science/api/pith-number/J3U4PDXJ2BQJQET4KKPP4G43YH/graph.json","fetch_events":"https://pith.science/api/pith-number/J3U4PDXJ2BQJQET4KKPP4G43YH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH/action/storage_attestation","attest_author":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH/action/author_attestation","sign_citation":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH/action/citation_signature","submit_replication":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH/action/replication_record"}},"created_at":"2026-05-18T02:21:43.022421+00:00","updated_at":"2026-05-18T02:21:43.022421+00:00"}