{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4XWZ2XYIOFH7H2LWGCGKIFTJWR","short_pith_number":"pith:4XWZ2XYI","schema_version":"1.0","canonical_sha256":"e5ed9d5f08714ff3e976308ca41669b46dfe200a272bab91927f4f5f9f826229","source":{"kind":"arxiv","id":"1306.0755","version":1},"attestation_state":"computed","paper":{"title":"Evaluating Wireless Reactive Routing Protocols with Linear Programming Model for Wireless Ad-hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"L. Ali, M. Ilahi, N. Javaid, R. D. Khan, U. Qasim, Z. A. Khan","submitted_at":"2013-06-04T12:47:49Z","abstract_excerpt":"In Wireless Ad-hoc Networks, nodes are free to move randomly and organize themselves arbitrarily, thus topology may change quickly and capriciously. In Mobile Ad-hoc NETworks, specially Wireless Multi-hop Networks provide users with facility of quick communication. In Wireless Multi-hop Networks, routing protocols with energy efficient and delay reduction techniques are needed to fulfill users demands. In this paper, we present Linear Programming models to assess and enhance reactive routing protocols. To practically examine constraints of respective Linear Programming models over reactive pro"},"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":"1306.0755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-06-04T12:47:49Z","cross_cats_sorted":[],"title_canon_sha256":"06a1359913e0ad6959775b700ebed9a80fe1a27a34e1423d979233c682ffdb92","abstract_canon_sha256":"75f1ad5df2081a175fadba2a3c65aa52206634edc000f3659405e007eb101143"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:53.282789Z","signature_b64":"+EWWcbZcp2eNyztmeO3K+CucXCoSbXivwJCM00Gt7IpTJbEtMP+k5ZfygO5jepU/A7Fp+//cvUUG9auK+DLGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5ed9d5f08714ff3e976308ca41669b46dfe200a272bab91927f4f5f9f826229","last_reissued_at":"2026-05-18T03:21:53.282392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:53.282392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating Wireless Reactive Routing Protocols with Linear Programming Model for Wireless Ad-hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"L. Ali, M. Ilahi, N. Javaid, R. D. Khan, U. Qasim, Z. A. Khan","submitted_at":"2013-06-04T12:47:49Z","abstract_excerpt":"In Wireless Ad-hoc Networks, nodes are free to move randomly and organize themselves arbitrarily, thus topology may change quickly and capriciously. In Mobile Ad-hoc NETworks, specially Wireless Multi-hop Networks provide users with facility of quick communication. In Wireless Multi-hop Networks, routing protocols with energy efficient and delay reduction techniques are needed to fulfill users demands. In this paper, we present Linear Programming models to assess and enhance reactive routing protocols. To practically examine constraints of respective Linear Programming models over reactive pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0755","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.0755","created_at":"2026-05-18T03:21:53.282445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0755v1","created_at":"2026-05-18T03:21:53.282445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0755","created_at":"2026-05-18T03:21:53.282445+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XWZ2XYIOFH7","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XWZ2XYIOFH7H2LW","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XWZ2XYI","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/4XWZ2XYIOFH7H2LWGCGKIFTJWR","json":"https://pith.science/pith/4XWZ2XYIOFH7H2LWGCGKIFTJWR.json","graph_json":"https://pith.science/api/pith-number/4XWZ2XYIOFH7H2LWGCGKIFTJWR/graph.json","events_json":"https://pith.science/api/pith-number/4XWZ2XYIOFH7H2LWGCGKIFTJWR/events.json","paper":"https://pith.science/paper/4XWZ2XYI"},"agent_actions":{"view_html":"https://pith.science/pith/4XWZ2XYIOFH7H2LWGCGKIFTJWR","download_json":"https://pith.science/pith/4XWZ2XYIOFH7H2LWGCGKIFTJWR.json","view_paper":"https://pith.science/paper/4XWZ2XYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0755&json=true","fetch_graph":"https://pith.science/api/pith-number/4XWZ2XYIOFH7H2LWGCGKIFTJWR/graph.json","fetch_events":"https://pith.science/api/pith-number/4XWZ2XYIOFH7H2LWGCGKIFTJWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XWZ2XYIOFH7H2LWGCGKIFTJWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XWZ2XYIOFH7H2LWGCGKIFTJWR/action/storage_attestation","attest_author":"https://pith.science/pith/4XWZ2XYIOFH7H2LWGCGKIFTJWR/action/author_attestation","sign_citation":"https://pith.science/pith/4XWZ2XYIOFH7H2LWGCGKIFTJWR/action/citation_signature","submit_replication":"https://pith.science/pith/4XWZ2XYIOFH7H2LWGCGKIFTJWR/action/replication_record"}},"created_at":"2026-05-18T03:21:53.282445+00:00","updated_at":"2026-05-18T03:21:53.282445+00:00"}