{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HNRHL7QWQU7ZKNQCOUCZ2O4EGR","short_pith_number":"pith:HNRHL7QW","canonical_record":{"source":{"id":"1312.5345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-18T21:30:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0d5bd074cf90f4eea0b8d46f8d7e880892c2e8dd35c6b2984c5950013e629fd6","abstract_canon_sha256":"c4b64c1b978f4d1e43b88315a2e11ac92171df7d2ac4fc311a94ba94db1f5159"},"schema_version":"1.0"},"canonical_sha256":"3b6275fe16853f95360275059d3b84347ebaec5d8ce3ba1245a0f96f3f1e25f2","source":{"kind":"arxiv","id":"1312.5345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5345","created_at":"2026-05-18T03:04:15Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5345v1","created_at":"2026-05-18T03:04:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5345","created_at":"2026-05-18T03:04:15Z"},{"alias_kind":"pith_short_12","alias_value":"HNRHL7QWQU7Z","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HNRHL7QWQU7ZKNQC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HNRHL7QW","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HNRHL7QWQU7ZKNQCOUCZ2O4EGR","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-18T21:30:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0d5bd074cf90f4eea0b8d46f8d7e880892c2e8dd35c6b2984c5950013e629fd6","abstract_canon_sha256":"c4b64c1b978f4d1e43b88315a2e11ac92171df7d2ac4fc311a94ba94db1f5159"},"schema_version":"1.0"},"canonical_sha256":"3b6275fe16853f95360275059d3b84347ebaec5d8ce3ba1245a0f96f3f1e25f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:15.040473Z","signature_b64":"bmyF5/CR3Bj6fh8ABLHg4LyW+89tjRC7QKRsP2MheTSWqAVFpEBr/qKjrcsxVo/vE0x3aI2EKDJuq3gAAbCrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b6275fe16853f95360275059d3b84347ebaec5d8ce3ba1245a0f96f3f1e25f2","last_reissued_at":"2026-05-18T03:04:15.039852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:15.039852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5345","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-18T03:04:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHhhUSgRrTtkJkTsTLQdnOI+RzDq1nQE6f2dAmgKePShubf0xgveAJzpeXfUVqCIT4zjmVsjq4BVJBlSWvbuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:48:26.674271Z"},"content_sha256":"37b867c91c57d6a686bff76d90eef4cfff0481541abdfc8243f0a2b0a2fa4435","schema_version":"1.0","event_id":"sha256:37b867c91c57d6a686bff76d90eef4cfff0481541abdfc8243f0a2b0a2fa4435"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HNRHL7QWQU7ZKNQCOUCZ2O4EGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Min Flow Rate Maximization for Software Defined Radio Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Farmanbar, Hang Zhang, Mingyi Hong, Wei-Cheng Liao, Xu Li, Zhi-Quan Luo","submitted_at":"2013-12-18T21:30:51Z","abstract_excerpt":"We consider a heterogeneous network (HetNet) of base stations (BSs) connected via a backhaul network of routers and wired/wireless links with limited capacity. The optimal provision of such networks requires proper resource allocation across the radio access links in conjunction with appropriate traffic engineering within the backhaul network. In this paper we propose an efficient algorithm for joint resource allocation across the wireless links and the flow control within the backhaul network. The proposed algorithm, which maximizes the minimum rate among all the users and/or flows, is based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5345","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-18T03:04:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGiXPqV3untoVbL4fYuGa7LBdCu0jSVx0XVH8+6ZNA9XySVHrhUmnhBmJrQAb6ZzlRalqfPQOykKADKlPfLwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:48:26.674939Z"},"content_sha256":"71132f8801cbc3665558f5668d1fbb8a4349bfca8043524a1583b9a5e3cd2954","schema_version":"1.0","event_id":"sha256:71132f8801cbc3665558f5668d1fbb8a4349bfca8043524a1583b9a5e3cd2954"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNRHL7QWQU7ZKNQCOUCZ2O4EGR/bundle.json","state_url":"https://pith.science/pith/HNRHL7QWQU7ZKNQCOUCZ2O4EGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNRHL7QWQU7ZKNQCOUCZ2O4EGR/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-05-31T07:48:26Z","links":{"resolver":"https://pith.science/pith/HNRHL7QWQU7ZKNQCOUCZ2O4EGR","bundle":"https://pith.science/pith/HNRHL7QWQU7ZKNQCOUCZ2O4EGR/bundle.json","state":"https://pith.science/pith/HNRHL7QWQU7ZKNQCOUCZ2O4EGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNRHL7QWQU7ZKNQCOUCZ2O4EGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HNRHL7QWQU7ZKNQCOUCZ2O4EGR","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":"c4b64c1b978f4d1e43b88315a2e11ac92171df7d2ac4fc311a94ba94db1f5159","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-18T21:30:51Z","title_canon_sha256":"0d5bd074cf90f4eea0b8d46f8d7e880892c2e8dd35c6b2984c5950013e629fd6"},"schema_version":"1.0","source":{"id":"1312.5345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5345","created_at":"2026-05-18T03:04:15Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5345v1","created_at":"2026-05-18T03:04:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5345","created_at":"2026-05-18T03:04:15Z"},{"alias_kind":"pith_short_12","alias_value":"HNRHL7QWQU7Z","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HNRHL7QWQU7ZKNQC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HNRHL7QW","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:71132f8801cbc3665558f5668d1fbb8a4349bfca8043524a1583b9a5e3cd2954","target":"graph","created_at":"2026-05-18T03:04:15Z","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 a heterogeneous network (HetNet) of base stations (BSs) connected via a backhaul network of routers and wired/wireless links with limited capacity. The optimal provision of such networks requires proper resource allocation across the radio access links in conjunction with appropriate traffic engineering within the backhaul network. In this paper we propose an efficient algorithm for joint resource allocation across the wireless links and the flow control within the backhaul network. The proposed algorithm, which maximizes the minimum rate among all the users and/or flows, is based ","authors_text":"Hamid Farmanbar, Hang Zhang, Mingyi Hong, Wei-Cheng Liao, Xu Li, Zhi-Quan Luo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-18T21:30:51Z","title":"Min Flow Rate Maximization for Software Defined Radio Access Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5345","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:37b867c91c57d6a686bff76d90eef4cfff0481541abdfc8243f0a2b0a2fa4435","target":"record","created_at":"2026-05-18T03:04:15Z","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":"c4b64c1b978f4d1e43b88315a2e11ac92171df7d2ac4fc311a94ba94db1f5159","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-18T21:30:51Z","title_canon_sha256":"0d5bd074cf90f4eea0b8d46f8d7e880892c2e8dd35c6b2984c5950013e629fd6"},"schema_version":"1.0","source":{"id":"1312.5345","kind":"arxiv","version":1}},"canonical_sha256":"3b6275fe16853f95360275059d3b84347ebaec5d8ce3ba1245a0f96f3f1e25f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b6275fe16853f95360275059d3b84347ebaec5d8ce3ba1245a0f96f3f1e25f2","first_computed_at":"2026-05-18T03:04:15.039852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:15.039852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bmyF5/CR3Bj6fh8ABLHg4LyW+89tjRC7QKRsP2MheTSWqAVFpEBr/qKjrcsxVo/vE0x3aI2EKDJuq3gAAbCrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:15.040473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37b867c91c57d6a686bff76d90eef4cfff0481541abdfc8243f0a2b0a2fa4435","sha256:71132f8801cbc3665558f5668d1fbb8a4349bfca8043524a1583b9a5e3cd2954"],"state_sha256":"60b55eea5be50849f5c7da79e021b301e467751f2fbeef347c17b396dd854049"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r3e0QqPlWz3oMxVYmbdMinJhlH+dN0f/mFQAmTgnnRSDmoV33R/lXEkD1FEQFIaHoablYljCGlq7kuUPMkI8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:48:26.678696Z","bundle_sha256":"e4382dd3727a523f943c1c418ad7314a10958f39674bea368190573ae14c70f5"}}