{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RDTKR47LVLFVUUZJBEEWB5HPJU","short_pith_number":"pith:RDTKR47L","canonical_record":{"source":{"id":"1201.3723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-18T08:48:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0138e09d393028f8b2bef5f4e57034981808ff3b123b43629db5b3da8cf6d74d","abstract_canon_sha256":"1f970af9db9133022790de792fb8bec00a3ccfdf21a4e76e5ffab599520a7831"},"schema_version":"1.0"},"canonical_sha256":"88e6a8f3ebaacb5a5329090960f4ef4d269dc545797a9e679be565cded71e7c6","source":{"kind":"arxiv","id":"1201.3723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3723","created_at":"2026-05-18T04:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3723v1","created_at":"2026-05-18T04:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3723","created_at":"2026-05-18T04:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"RDTKR47LVLFV","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RDTKR47LVLFVUUZJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RDTKR47L","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RDTKR47LVLFVUUZJBEEWB5HPJU","target":"record","payload":{"canonical_record":{"source":{"id":"1201.3723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-18T08:48:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0138e09d393028f8b2bef5f4e57034981808ff3b123b43629db5b3da8cf6d74d","abstract_canon_sha256":"1f970af9db9133022790de792fb8bec00a3ccfdf21a4e76e5ffab599520a7831"},"schema_version":"1.0"},"canonical_sha256":"88e6a8f3ebaacb5a5329090960f4ef4d269dc545797a9e679be565cded71e7c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:18.181420Z","signature_b64":"fkzsUWAwcDgp+LuDqkJY0w+HFlqrFa1lyNhAUnyMS8yJ1ScI7LFyqtenaNmftS8NMwSk01ucylvH5yHW3HtEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88e6a8f3ebaacb5a5329090960f4ef4d269dc545797a9e679be565cded71e7c6","last_reissued_at":"2026-05-18T04:04:18.180533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:18.180533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.3723","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-18T04:04:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jyCtANw1JUhZAuTxzd6Ffzf73RIUdjrrf/nf17YFbxqfZlD3dMbVM/yrNt5ME+Tr5QqQEXYCNmJlMAc6WqwaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:42:00.607178Z"},"content_sha256":"da32c9a173aa8411709c0cb1d83f8526bf15c3da1dc26eea626bbd4532462c7b","schema_version":"1.0","event_id":"sha256:da32c9a173aa8411709c0cb1d83f8526bf15c3da1dc26eea626bbd4532462c7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RDTKR47LVLFVUUZJBEEWB5HPJU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proportional Fair Coding for Wireless Mesh Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Douglas Leith, Premkumar Karumbu, Xiaomin Chen","submitted_at":"2012-01-18T08:48:48Z","abstract_excerpt":"We consider multi--hop wireless networks carrying unicast flows for multiple users. Each flow has a specified delay deadline, and the lossy wireless links are modelled as binary symmetric channels (BSCs). Since transmission time, also called airtime, on the links is shared amongst flows, increasing the airtime for one flow comes at the cost of reducing the airtime available to other flows sharing the same link. We derive the joint allocation of flow airtimes and coding rates that achieves the proportionally fair throughput allocation. This utility optimisation problem is non--convex, and one o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3723","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-18T04:04:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2sOWsP2v/l2lZOQ35w5OxN9rQrDK75so9Xe/ilgSsrv0KHqCXYhhLsV0/Hc9f9WL5g5TrJCTFZg1tsMqLPGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:42:00.607561Z"},"content_sha256":"8b436ff6878eb643cb5555720fffde74939748d12da4144ea42fd82a8d4999d9","schema_version":"1.0","event_id":"sha256:8b436ff6878eb643cb5555720fffde74939748d12da4144ea42fd82a8d4999d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDTKR47LVLFVUUZJBEEWB5HPJU/bundle.json","state_url":"https://pith.science/pith/RDTKR47LVLFVUUZJBEEWB5HPJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDTKR47LVLFVUUZJBEEWB5HPJU/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-11T12:42:00Z","links":{"resolver":"https://pith.science/pith/RDTKR47LVLFVUUZJBEEWB5HPJU","bundle":"https://pith.science/pith/RDTKR47LVLFVUUZJBEEWB5HPJU/bundle.json","state":"https://pith.science/pith/RDTKR47LVLFVUUZJBEEWB5HPJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDTKR47LVLFVUUZJBEEWB5HPJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RDTKR47LVLFVUUZJBEEWB5HPJU","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":"1f970af9db9133022790de792fb8bec00a3ccfdf21a4e76e5ffab599520a7831","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-18T08:48:48Z","title_canon_sha256":"0138e09d393028f8b2bef5f4e57034981808ff3b123b43629db5b3da8cf6d74d"},"schema_version":"1.0","source":{"id":"1201.3723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3723","created_at":"2026-05-18T04:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3723v1","created_at":"2026-05-18T04:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3723","created_at":"2026-05-18T04:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"RDTKR47LVLFV","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RDTKR47LVLFVUUZJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RDTKR47L","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:8b436ff6878eb643cb5555720fffde74939748d12da4144ea42fd82a8d4999d9","target":"graph","created_at":"2026-05-18T04:04:18Z","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 consider multi--hop wireless networks carrying unicast flows for multiple users. Each flow has a specified delay deadline, and the lossy wireless links are modelled as binary symmetric channels (BSCs). Since transmission time, also called airtime, on the links is shared amongst flows, increasing the airtime for one flow comes at the cost of reducing the airtime available to other flows sharing the same link. We derive the joint allocation of flow airtimes and coding rates that achieves the proportionally fair throughput allocation. This utility optimisation problem is non--convex, and one o","authors_text":"Douglas Leith, Premkumar Karumbu, Xiaomin Chen","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-18T08:48:48Z","title":"Proportional Fair Coding for Wireless Mesh Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3723","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:da32c9a173aa8411709c0cb1d83f8526bf15c3da1dc26eea626bbd4532462c7b","target":"record","created_at":"2026-05-18T04:04:18Z","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":"1f970af9db9133022790de792fb8bec00a3ccfdf21a4e76e5ffab599520a7831","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-18T08:48:48Z","title_canon_sha256":"0138e09d393028f8b2bef5f4e57034981808ff3b123b43629db5b3da8cf6d74d"},"schema_version":"1.0","source":{"id":"1201.3723","kind":"arxiv","version":1}},"canonical_sha256":"88e6a8f3ebaacb5a5329090960f4ef4d269dc545797a9e679be565cded71e7c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88e6a8f3ebaacb5a5329090960f4ef4d269dc545797a9e679be565cded71e7c6","first_computed_at":"2026-05-18T04:04:18.180533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:18.180533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fkzsUWAwcDgp+LuDqkJY0w+HFlqrFa1lyNhAUnyMS8yJ1ScI7LFyqtenaNmftS8NMwSk01ucylvH5yHW3HtEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:18.181420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.3723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da32c9a173aa8411709c0cb1d83f8526bf15c3da1dc26eea626bbd4532462c7b","sha256:8b436ff6878eb643cb5555720fffde74939748d12da4144ea42fd82a8d4999d9"],"state_sha256":"aee9463162d15745f14650456633eff03b0de6cc5dd03399b6a37c5e6a3694a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L0KGRMsooEvFNqgSJL2c8fO4tY8s8+/+TIWOIIW5CpeIlS4MSG3YN3at0UuMFJTtsoJuKLYzQYm8+s8YwYS6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:42:00.609893Z","bundle_sha256":"fe497d7fe63f2d56778ef83c40785f5febe3b56ef86c3294480b90fd391d9d20"}}