{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5RGT3ROUJB35YFIBPEANXJC5BN","short_pith_number":"pith:5RGT3ROU","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"},"canonical_sha256":"ec4d3dc5d44877dc15017900dba45d0b425d3f604ed39012c3a84161b0a68d09","source":{"kind":"arxiv","id":"1309.0364","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0364","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0364v2","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0364","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"5RGT3ROUJB35","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5RGT3ROUJB35YFIB","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5RGT3ROU","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5RGT3ROUJB35YFIBPEANXJC5BN","target":"record","payload":{"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"},"canonical_sha256":"ec4d3dc5d44877dc15017900dba45d0b425d3f604ed39012c3a84161b0a68d09","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"},"source_kind":"arxiv","source_id":"1309.0364","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-18T00:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"of2hGdxUYYTUYX0W66C2UlkUhQ/Z0Ox7qwdScLcVq4gd+dNSUm1/1N/nklBJmW+hiFUSMCIfjMHkH1C7CePLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:52:44.305990Z"},"content_sha256":"635913e3ba4662f99840d5c78e8d4dcc7fc8fce90926e22e72123b77fdab1dd1","schema_version":"1.0","event_id":"sha256:635913e3ba4662f99840d5c78e8d4dcc7fc8fce90926e22e72123b77fdab1dd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5RGT3ROUJB35YFIBPEANXJC5BN","target":"graph","payload":{"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"},"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-18T00:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lLD/IJJr1eh47P41np+qXPbBmatZXwyYoYbnTuwLgYEA2MFBM1zFwYdCjTMxlMWwCEAHpLP7AOFNGSQatD8cCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:52:44.306477Z"},"content_sha256":"b999225faf45908f6aebdc79e5624992ee9b3ffa19c23c3f478bced1b9c201d5","schema_version":"1.0","event_id":"sha256:b999225faf45908f6aebdc79e5624992ee9b3ffa19c23c3f478bced1b9c201d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN/bundle.json","state_url":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5RGT3ROUJB35YFIBPEANXJC5BN/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-23T15:52:44Z","links":{"resolver":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN","bundle":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN/bundle.json","state":"https://pith.science/pith/5RGT3ROUJB35YFIBPEANXJC5BN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5RGT3ROUJB35YFIBPEANXJC5BN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5RGT3ROUJB35YFIBPEANXJC5BN","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":"be498295a4f9bb85ca7e1c2748ef2a89137834241ba9e40387816e2c9fba6e97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-09-02T11:02:29Z","title_canon_sha256":"3729dbff1205981f701256ddab49b85efd0d9749029ffae51f4f689943205538"},"schema_version":"1.0","source":{"id":"1309.0364","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0364","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0364v2","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0364","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"5RGT3ROUJB35","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5RGT3ROUJB35YFIB","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5RGT3ROU","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:b999225faf45908f6aebdc79e5624992ee9b3ffa19c23c3f478bced1b9c201d5","target":"graph","created_at":"2026-05-18T00:59:03Z","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 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","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":"2013-09-02T11:02:29Z","title":"Throughput Optimal Flow Allocation on Multiple Paths for Random Access Wireless Multi-hop Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0364","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:635913e3ba4662f99840d5c78e8d4dcc7fc8fce90926e22e72123b77fdab1dd1","target":"record","created_at":"2026-05-18T00:59:03Z","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":"be498295a4f9bb85ca7e1c2748ef2a89137834241ba9e40387816e2c9fba6e97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-09-02T11:02:29Z","title_canon_sha256":"3729dbff1205981f701256ddab49b85efd0d9749029ffae51f4f689943205538"},"schema_version":"1.0","source":{"id":"1309.0364","kind":"arxiv","version":2}},"canonical_sha256":"ec4d3dc5d44877dc15017900dba45d0b425d3f604ed39012c3a84161b0a68d09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec4d3dc5d44877dc15017900dba45d0b425d3f604ed39012c3a84161b0a68d09","first_computed_at":"2026-05-18T00:59:03.813253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:03.813253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8CmSNFYrMYQL/9lLONLw+jg0SeOLn3DYRiROYYz+KsFobOp1lP1vCDgUAlLh9w2Z9vKO/Thj0Q/6TOH1pKBWAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:03.813917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0364","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:635913e3ba4662f99840d5c78e8d4dcc7fc8fce90926e22e72123b77fdab1dd1","sha256:b999225faf45908f6aebdc79e5624992ee9b3ffa19c23c3f478bced1b9c201d5"],"state_sha256":"a459874a8454576a10b4e0cfdb3cddabcb7381481757e2deae7030187092ba63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VRKdXjH/Ul7cx3Icp1ZHVB8qGhxmGlDCrHZJJ7adKpoZdpOUDfugfUOBv4TfFGhn9uQIlfh6Wq1IPzSPlxEqCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:52:44.309152Z","bundle_sha256":"641f7dac117f5a961954c3427c0c482726b55d3d0abbcf79e5194b3a309e8125"}}