{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5RGT3ROUJB35YFIBPEANXJC5BN","short_pith_number":"pith:5RGT3ROU","schema_version":"1.0","canonical_sha256":"ec4d3dc5d44877dc15017900dba45d0b425d3f604ed39012c3a84161b0a68d09","source":{"kind":"arxiv","id":"1309.0364","version":2},"attestation_state":"computed","paper":{"title":"Throughput Optimal Flow Allocation on Multiple Paths for Random Access Wireless Multi-hop Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Apostolos Traganitis, Manolis Ploumidis, Nikolaos Pappas","submitted_at":"2013-09-02T11:02:29Z","abstract_excerpt":"In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate throughput-optimal flow rate allocation with bounded delay guarantees. We propose a distributed flow rate allocation scheme that formulates flow rate allocation as an optimization problem and derive the conditions for non-convexity for an illustrative topology. We also employ a simple model for the average aggregate throughput achieved by all flows that captures both in"},"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":"1309.0364","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-09-02T11:02:29Z","cross_cats_sorted":[],"title_canon_sha256":"3729dbff1205981f701256ddab49b85efd0d9749029ffae51f4f689943205538","abstract_canon_sha256":"be498295a4f9bb85ca7e1c2748ef2a89137834241ba9e40387816e2c9fba6e97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.813917Z","signature_b64":"8CmSNFYrMYQL/9lLONLw+jg0SeOLn3DYRiROYYz+KsFobOp1lP1vCDgUAlLh9w2Z9vKO/Thj0Q/6TOH1pKBWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec4d3dc5d44877dc15017900dba45d0b425d3f604ed39012c3a84161b0a68d09","last_reissued_at":"2026-05-18T00:59:03.813253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.813253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throughput Optimal Flow Allocation on Multiple Paths for Random Access Wireless Multi-hop Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Apostolos Traganitis, Manolis Ploumidis, Nikolaos Pappas","submitted_at":"2013-09-02T11:02:29Z","abstract_excerpt":"In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate throughput-optimal flow rate allocation with bounded delay guarantees. We propose a distributed flow rate allocation scheme that formulates flow rate allocation as an optimization problem and derive the conditions for non-convexity for an illustrative topology. We also employ a simple model for the average aggregate throughput achieved by all flows that captures both in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0364","kind":"arxiv","version":2},"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":"1309.0364","created_at":"2026-05-18T00:59:03.813356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.0364v2","created_at":"2026-05-18T00:59:03.813356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0364","created_at":"2026-05-18T00:59:03.813356+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RGT3ROUJB35","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RGT3ROUJB35YFIB","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RGT3ROU","created_at":"2026-05-18T12:27:34.582898+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/5RGT3ROUJB35YFIBPEANXJC5BN","json":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN.json","graph_json":"https://pith.science/api/pith-number/5RGT3ROUJB35YFIBPEANXJC5BN/graph.json","events_json":"https://pith.science/api/pith-number/5RGT3ROUJB35YFIBPEANXJC5BN/events.json","paper":"https://pith.science/paper/5RGT3ROU"},"agent_actions":{"view_html":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN","download_json":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN.json","view_paper":"https://pith.science/paper/5RGT3ROU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.0364&json=true","fetch_graph":"https://pith.science/api/pith-number/5RGT3ROUJB35YFIBPEANXJC5BN/graph.json","fetch_events":"https://pith.science/api/pith-number/5RGT3ROUJB35YFIBPEANXJC5BN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN/action/storage_attestation","attest_author":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN/action/author_attestation","sign_citation":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN/action/citation_signature","submit_replication":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN/action/replication_record"}},"created_at":"2026-05-18T00:59:03.813356+00:00","updated_at":"2026-05-18T00:59:03.813356+00:00"}