{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:J3U4PDXJ2BQJQET4KKPP4G43YH","short_pith_number":"pith:J3U4PDXJ","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"},"canonical_sha256":"4ee9c78ee9d06098127c529efe1b9bc1c0c433e1637fd7124c5efa0a19f9c258","source":{"kind":"arxiv","id":"1107.1890","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1890","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1890v1","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1890","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"J3U4PDXJ2BQJ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J3U4PDXJ2BQJQET4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J3U4PDXJ","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:J3U4PDXJ2BQJQET4KKPP4G43YH","target":"record","payload":{"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"},"canonical_sha256":"4ee9c78ee9d06098127c529efe1b9bc1c0c433e1637fd7124c5efa0a19f9c258","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"},"source_kind":"arxiv","source_id":"1107.1890","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/6XStMk7zReBYvGEAdRrQxvNFEgQ52HHZZDnZzSJyQPLEnBukdxK/LWEYdkBKDHzF4HwLGC5rGrKQ8ao/X9VCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:13:09.558612Z"},"content_sha256":"825afa5cdd3fd7c0ec316b1b14fb0dba833820de86efcd9d17b4a43cc1a602a5","schema_version":"1.0","event_id":"sha256:825afa5cdd3fd7c0ec316b1b14fb0dba833820de86efcd9d17b4a43cc1a602a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:J3U4PDXJ2BQJQET4KKPP4G43YH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfpe349iznVZzaaecLn6TrHfPQu7dbvLCWvUQgaVotKYFxB5ees8H4YaxKg/kB1N+AhK/2qhkkF0pG7Jz9GnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:13:09.558962Z"},"content_sha256":"5f3344cf77a1810fcf853b16a3bbfabb226460ac1abda075a6ab9044b6de8805","schema_version":"1.0","event_id":"sha256:5f3344cf77a1810fcf853b16a3bbfabb226460ac1abda075a6ab9044b6de8805"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH/bundle.json","state_url":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3U4PDXJ2BQJQET4KKPP4G43YH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T03:13:09Z","links":{"resolver":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH","bundle":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH/bundle.json","state":"https://pith.science/pith/J3U4PDXJ2BQJQET4KKPP4G43YH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3U4PDXJ2BQJQET4KKPP4G43YH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:J3U4PDXJ2BQJQET4KKPP4G43YH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6b854f8e69ebff01d0bfd76a02c13d17457822a5d5042e15e0e4b9f1cbc8c3ab","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-10T19:51:52Z","title_canon_sha256":"649a04bf79e9772c52734bc9a2bfe13baa5518cc9ba688948dcaf45c9a2e8a4a"},"schema_version":"1.0","source":{"id":"1107.1890","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1890","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1890v1","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1890","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"J3U4PDXJ2BQJ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J3U4PDXJ2BQJQET4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J3U4PDXJ","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:5f3344cf77a1810fcf853b16a3bbfabb226460ac1abda075a6ab9044b6de8805","target":"graph","created_at":"2026-05-18T02:21:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Douglas J. Leith, Premkumar Karumbu, Xiaomin Chen","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-10T19:51:52Z","title":"Utility Optimal Coding for Packet Transmission over Wireless Networks - Part II: Networks of Packet Erasure Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1890","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:825afa5cdd3fd7c0ec316b1b14fb0dba833820de86efcd9d17b4a43cc1a602a5","target":"record","created_at":"2026-05-18T02:21:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6b854f8e69ebff01d0bfd76a02c13d17457822a5d5042e15e0e4b9f1cbc8c3ab","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-10T19:51:52Z","title_canon_sha256":"649a04bf79e9772c52734bc9a2bfe13baa5518cc9ba688948dcaf45c9a2e8a4a"},"schema_version":"1.0","source":{"id":"1107.1890","kind":"arxiv","version":1}},"canonical_sha256":"4ee9c78ee9d06098127c529efe1b9bc1c0c433e1637fd7124c5efa0a19f9c258","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ee9c78ee9d06098127c529efe1b9bc1c0c433e1637fd7124c5efa0a19f9c258","first_computed_at":"2026-05-18T02:21:43.022346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:43.022346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WoqFglEmNCS4B8nbYUEBMJ0gxqjS7BmgVZa294IFZpZZAN5VilozcPcVgkCeYkV+sUMp6S1kprYp3T/rhBO1Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:43.022830Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1890","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:825afa5cdd3fd7c0ec316b1b14fb0dba833820de86efcd9d17b4a43cc1a602a5","sha256:5f3344cf77a1810fcf853b16a3bbfabb226460ac1abda075a6ab9044b6de8805"],"state_sha256":"3b077bc4cea50b90ddb753fe71094c221d61769d6c4f73fe7143a902755ea8bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QUsQ3EOakbvjucvhpO/hqf+KPjUOV1I982wYK+SMkg4VXTsxQ+elT+O7xkzl0l3yfjd4EgTmzET8nzyBKnDSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:13:09.561064Z","bundle_sha256":"9848777d1909bbc31d93fec88d95585ace2dcac24e204990320638ad92cff168"}}