{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZR352E752GVEJME4I2XGIKA6T4","short_pith_number":"pith:ZR352E75","canonical_record":{"source":{"id":"1304.0154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-31T04:39:06Z","cross_cats_sorted":[],"title_canon_sha256":"31d17b8ec7aba93c6baf88522220643abb4bf1f4f15c427b58879ab4732d4d0e","abstract_canon_sha256":"b3593cee3a59703aa0b56cd0fdb56643495f739b1cc3e8a8394544c76b574091"},"schema_version":"1.0"},"canonical_sha256":"cc77dd13fdd1aa44b09c46ae64281e9f05dbbd47b46fd32ac584cb9f472c8f1b","source":{"kind":"arxiv","id":"1304.0154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0154","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0154v1","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0154","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZR352E752GVE","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZR352E752GVEJME4","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZR352E75","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZR352E752GVEJME4I2XGIKA6T4","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-31T04:39:06Z","cross_cats_sorted":[],"title_canon_sha256":"31d17b8ec7aba93c6baf88522220643abb4bf1f4f15c427b58879ab4732d4d0e","abstract_canon_sha256":"b3593cee3a59703aa0b56cd0fdb56643495f739b1cc3e8a8394544c76b574091"},"schema_version":"1.0"},"canonical_sha256":"cc77dd13fdd1aa44b09c46ae64281e9f05dbbd47b46fd32ac584cb9f472c8f1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.202255Z","signature_b64":"cRO7NEt6yEqvnL6iTthDoE2q3CIpoeJxN4aObJYwzpYmCr51SNZBjhFsTy/1F+PuMZVKGtYe+2TXY85Ut5nfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc77dd13fdd1aa44b09c46ae64281e9f05dbbd47b46fd32ac584cb9f472c8f1b","last_reissued_at":"2026-05-18T00:59:04.201530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.201530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0154","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-18T00:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qumvVJZf+rTrxELOUsYgQxkGpDD5fVj5e0XR1EJB+SjEuPuaGYLTda/dqM2E2Rm5G9VMX7DRC+7OqHC27kYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:36:26.431212Z"},"content_sha256":"635acdd30f4862f0a676eae61bff47bf3dd59398c2afd7492d9326ca745f2138","schema_version":"1.0","event_id":"sha256:635acdd30f4862f0a676eae61bff47bf3dd59398c2afd7492d9326ca745f2138"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZR352E752GVEJME4I2XGIKA6T4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards LP Modeling for Maximizing Throughput and Minimizing Routing Delay in Proactive Protocols in Wireless Multi-hop Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"A. Javaid, K. Latif, M. A. Khan, N. Javaid, U. Qasim, Z. A. Khan","submitted_at":"2013-03-31T04:39:06Z","abstract_excerpt":"Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different routing protocols are used to facilitate users demand(s). To practically examine constraints of respective LP_models over different routing techniques, we select three proactive routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0154","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-18T00:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wv/SBGH2ZkplMd7zBqtG677dVhMbN2lAiPcIOCSpFl8gHIrgpOJfHBUzBJw2OGzK2iIMV+T7zfLaGxY/SHl3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:36:26.431927Z"},"content_sha256":"ac5ae155e451c50f817fb67a107eddcddc58486c11b4ad0fad1289da4f4402a9","schema_version":"1.0","event_id":"sha256:ac5ae155e451c50f817fb67a107eddcddc58486c11b4ad0fad1289da4f4402a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZR352E752GVEJME4I2XGIKA6T4/bundle.json","state_url":"https://pith.science/pith/ZR352E752GVEJME4I2XGIKA6T4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZR352E752GVEJME4I2XGIKA6T4/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-04T23:36:26Z","links":{"resolver":"https://pith.science/pith/ZR352E752GVEJME4I2XGIKA6T4","bundle":"https://pith.science/pith/ZR352E752GVEJME4I2XGIKA6T4/bundle.json","state":"https://pith.science/pith/ZR352E752GVEJME4I2XGIKA6T4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZR352E752GVEJME4I2XGIKA6T4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZR352E752GVEJME4I2XGIKA6T4","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":"b3593cee3a59703aa0b56cd0fdb56643495f739b1cc3e8a8394544c76b574091","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-31T04:39:06Z","title_canon_sha256":"31d17b8ec7aba93c6baf88522220643abb4bf1f4f15c427b58879ab4732d4d0e"},"schema_version":"1.0","source":{"id":"1304.0154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0154","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0154v1","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0154","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZR352E752GVE","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZR352E752GVEJME4","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZR352E75","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:ac5ae155e451c50f817fb67a107eddcddc58486c11b4ad0fad1289da4f4402a9","target":"graph","created_at":"2026-05-18T00:59:04Z","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":"Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different routing protocols are used to facilitate users demand(s). To practically examine constraints of respective LP_models over different routing techniques, we select three proactive routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and O","authors_text":"A. Javaid, K. Latif, M. A. Khan, N. Javaid, U. Qasim, Z. A. Khan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-31T04:39:06Z","title":"Towards LP Modeling for Maximizing Throughput and Minimizing Routing Delay in Proactive Protocols in Wireless Multi-hop Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0154","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:635acdd30f4862f0a676eae61bff47bf3dd59398c2afd7492d9326ca745f2138","target":"record","created_at":"2026-05-18T00:59:04Z","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":"b3593cee3a59703aa0b56cd0fdb56643495f739b1cc3e8a8394544c76b574091","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-31T04:39:06Z","title_canon_sha256":"31d17b8ec7aba93c6baf88522220643abb4bf1f4f15c427b58879ab4732d4d0e"},"schema_version":"1.0","source":{"id":"1304.0154","kind":"arxiv","version":1}},"canonical_sha256":"cc77dd13fdd1aa44b09c46ae64281e9f05dbbd47b46fd32ac584cb9f472c8f1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc77dd13fdd1aa44b09c46ae64281e9f05dbbd47b46fd32ac584cb9f472c8f1b","first_computed_at":"2026-05-18T00:59:04.201530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:04.201530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cRO7NEt6yEqvnL6iTthDoE2q3CIpoeJxN4aObJYwzpYmCr51SNZBjhFsTy/1F+PuMZVKGtYe+2TXY85Ut5nfCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:04.202255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:635acdd30f4862f0a676eae61bff47bf3dd59398c2afd7492d9326ca745f2138","sha256:ac5ae155e451c50f817fb67a107eddcddc58486c11b4ad0fad1289da4f4402a9"],"state_sha256":"9fc0007a8b9db7cfb98d1e41071ad8e9cead2beb363e1f1916425248eb71c2dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1qdhMpqL/b3LzvO6Yw4NQ2uHqtKOr3V3o9bJtf4pt+Xax1+4vxwvqAGwj160LXwd2FAPUmUQ0z+tQHMU5Ld8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:36:26.436205Z","bundle_sha256":"c5b5aa9962af818e0cfe4d729b948311db9d020bb19a4a5f0272ed07dec4fdf3"}}