{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PPERW63ZVQ7KVP7QBGLK2KU7PN","short_pith_number":"pith:PPERW63Z","schema_version":"1.0","canonical_sha256":"7bc91b7b79ac3eaabff00996ad2a9f7b42912badd46d14d20d61de27345c97ff","source":{"kind":"arxiv","id":"1406.6304","version":2},"attestation_state":"computed","paper":{"title":"Flow Allocation for Maximum Throughput and Bounded Delay on Multiple Disjoint Paths for Random Access Wireless Multihop 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":"2014-06-24T16:52:19Z","abstract_excerpt":"In this paper, we consider random access, wireless, multi-hop networks, with multi-packet reception capabilities, where multiple flows are forwarded to the gateways through node disjoint paths. We explore the issue of allocating flow on multiple paths, exhibiting both intra- and inter-path interference, in order to maximize average aggregate flow throughput (AAT) and also provide bounded packet delay. A distributed flow allocation scheme is proposed where allocation of flow on paths is formulated as an optimization problem. Through an illustrative topology it is shown that the corresponding pr"},"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":"1406.6304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-06-24T16:52:19Z","cross_cats_sorted":[],"title_canon_sha256":"568f879e73baadc8230fcc93dc173ad2e6784021af245f4906f32a60d9cbf801","abstract_canon_sha256":"798d779314eb6934763289be40042a1c7ef4fc6fdb23e2a7df76c7dd67239c29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:15.060999Z","signature_b64":"IIfv9uBmLz3PQe1abhzhPMXF54hl7Hkp0QkpDddEtb8p8ZPZdfsFn6q3djdOVEuZ2XKz1V7HImDK4tnSupP0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bc91b7b79ac3eaabff00996ad2a9f7b42912badd46d14d20d61de27345c97ff","last_reissued_at":"2026-05-18T01:18:15.060237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:15.060237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flow Allocation for Maximum Throughput and Bounded Delay on Multiple Disjoint Paths for Random Access Wireless Multihop 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":"2014-06-24T16:52:19Z","abstract_excerpt":"In this paper, we consider random access, wireless, multi-hop networks, with multi-packet reception capabilities, where multiple flows are forwarded to the gateways through node disjoint paths. We explore the issue of allocating flow on multiple paths, exhibiting both intra- and inter-path interference, in order to maximize average aggregate flow throughput (AAT) and also provide bounded packet delay. A distributed flow allocation scheme is proposed where allocation of flow on paths is formulated as an optimization problem. Through an illustrative topology it is shown that the corresponding pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6304","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":"1406.6304","created_at":"2026-05-18T01:18:15.060378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6304v2","created_at":"2026-05-18T01:18:15.060378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6304","created_at":"2026-05-18T01:18:15.060378+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPERW63ZVQ7K","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPERW63ZVQ7KVP7Q","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPERW63Z","created_at":"2026-05-18T12:28:43.426989+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/PPERW63ZVQ7KVP7QBGLK2KU7PN","json":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN.json","graph_json":"https://pith.science/api/pith-number/PPERW63ZVQ7KVP7QBGLK2KU7PN/graph.json","events_json":"https://pith.science/api/pith-number/PPERW63ZVQ7KVP7QBGLK2KU7PN/events.json","paper":"https://pith.science/paper/PPERW63Z"},"agent_actions":{"view_html":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN","download_json":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN.json","view_paper":"https://pith.science/paper/PPERW63Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6304&json=true","fetch_graph":"https://pith.science/api/pith-number/PPERW63ZVQ7KVP7QBGLK2KU7PN/graph.json","fetch_events":"https://pith.science/api/pith-number/PPERW63ZVQ7KVP7QBGLK2KU7PN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN/action/storage_attestation","attest_author":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN/action/author_attestation","sign_citation":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN/action/citation_signature","submit_replication":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN/action/replication_record"}},"created_at":"2026-05-18T01:18:15.060378+00:00","updated_at":"2026-05-18T01:18:15.060378+00:00"}