{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PPERW63ZVQ7KVP7QBGLK2KU7PN","short_pith_number":"pith:PPERW63Z","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"},"canonical_sha256":"7bc91b7b79ac3eaabff00996ad2a9f7b42912badd46d14d20d61de27345c97ff","source":{"kind":"arxiv","id":"1406.6304","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6304","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6304v2","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6304","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"PPERW63ZVQ7K","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PPERW63ZVQ7KVP7Q","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PPERW63Z","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PPERW63ZVQ7KVP7QBGLK2KU7PN","target":"record","payload":{"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"},"canonical_sha256":"7bc91b7b79ac3eaabff00996ad2a9f7b42912badd46d14d20d61de27345c97ff","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"},"source_kind":"arxiv","source_id":"1406.6304","source_version":2,"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-18T01:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0/mPKoWa3fAjokRcHPRAmJR3/jHDYB7leFLv6TnJjpBXMi5PkmnShdHZ/MXxFX87s6AzTMFrJpdYkT1Tg7liBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:55:11.994394Z"},"content_sha256":"0d9cfea88da982c46aef3196a0632b1eeb486c90aee83a9cafa2d7b6265fe839","schema_version":"1.0","event_id":"sha256:0d9cfea88da982c46aef3196a0632b1eeb486c90aee83a9cafa2d7b6265fe839"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PPERW63ZVQ7KVP7QBGLK2KU7PN","target":"graph","payload":{"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"},"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-18T01:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNXbhu/wgIeGFFYy/x6Vixptb06dn2YrP87OsH2rzxebECXB111v9IiWGBgx3gZjUbsQ8J6mOl542/dgBwSDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:55:11.995113Z"},"content_sha256":"54a3a87496de64d23520535301b8a6771a7ffa4521d848e5a129ce124dac9818","schema_version":"1.0","event_id":"sha256:54a3a87496de64d23520535301b8a6771a7ffa4521d848e5a129ce124dac9818"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN/bundle.json","state_url":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN/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-05T21:55:11Z","links":{"resolver":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN","bundle":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN/bundle.json","state":"https://pith.science/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPERW63ZVQ7KVP7QBGLK2KU7PN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PPERW63ZVQ7KVP7QBGLK2KU7PN","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":"798d779314eb6934763289be40042a1c7ef4fc6fdb23e2a7df76c7dd67239c29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-06-24T16:52:19Z","title_canon_sha256":"568f879e73baadc8230fcc93dc173ad2e6784021af245f4906f32a60d9cbf801"},"schema_version":"1.0","source":{"id":"1406.6304","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6304","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6304v2","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6304","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"PPERW63ZVQ7K","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PPERW63ZVQ7KVP7Q","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PPERW63Z","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:54a3a87496de64d23520535301b8a6771a7ffa4521d848e5a129ce124dac9818","target":"graph","created_at":"2026-05-18T01:18: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":"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","authors_text":"Apostolos Traganitis, Manolis Ploumidis, Nikolaos Pappas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-06-24T16:52:19Z","title":"Flow Allocation for Maximum Throughput and Bounded Delay on Multiple Disjoint Paths for Random Access Wireless Multihop Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6304","kind":"arxiv","version":2},"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:0d9cfea88da982c46aef3196a0632b1eeb486c90aee83a9cafa2d7b6265fe839","target":"record","created_at":"2026-05-18T01:18: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":"798d779314eb6934763289be40042a1c7ef4fc6fdb23e2a7df76c7dd67239c29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-06-24T16:52:19Z","title_canon_sha256":"568f879e73baadc8230fcc93dc173ad2e6784021af245f4906f32a60d9cbf801"},"schema_version":"1.0","source":{"id":"1406.6304","kind":"arxiv","version":2}},"canonical_sha256":"7bc91b7b79ac3eaabff00996ad2a9f7b42912badd46d14d20d61de27345c97ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bc91b7b79ac3eaabff00996ad2a9f7b42912badd46d14d20d61de27345c97ff","first_computed_at":"2026-05-18T01:18:15.060237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:15.060237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IIfv9uBmLz3PQe1abhzhPMXF54hl7Hkp0QkpDddEtb8p8ZPZdfsFn6q3djdOVEuZ2XKz1V7HImDK4tnSupP0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:15.060999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.6304","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d9cfea88da982c46aef3196a0632b1eeb486c90aee83a9cafa2d7b6265fe839","sha256:54a3a87496de64d23520535301b8a6771a7ffa4521d848e5a129ce124dac9818"],"state_sha256":"b35e09735fe6bf8ea01ffe03a1cce704eea6a20fa0e9fe293817aca1fdf6896b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SNr/xKm3hfI990v57I1xZ6i8v/MpYhc90Lfx52f5ox9cFki2F76hIrAfaer7pvKFcW8VioxTQqJFK8ZyKYmXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:55:11.998396Z","bundle_sha256":"5b6d0625cfb878d8e96cff260b4aabbadf0bc6af3428382a1fe3d58b637678eb"}}