{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:K6E4WNNDHM5OZ7X2QWE35JYEWM","short_pith_number":"pith:K6E4WNND","schema_version":"1.0","canonical_sha256":"5789cb35a33b3aecfefa8589bea704b32a803f3b91ad890b3bdb7e94436eded8","source":{"kind":"arxiv","id":"1009.4672","version":1},"attestation_state":"computed","paper":{"title":"Threshold Policy for Route Discovery Initiation in Mobile Ad hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Joy Kuri, Tapas Kumar Patra","submitted_at":"2010-09-23T18:13:16Z","abstract_excerpt":"Achieving optimal transmission throughput in data networks in a multi-hop wireless networks is fundamental but hard problem. The situation is aggravated when nodes are mobile. Further, multi-rate system make the analysis of throughput more complicated. In mobile scenario, link may break or be created as nodes are moving within communication range. `Route Discovery' which is to find the optimal route and transmission schedule is an important issue. Route discovery entails some cost; so one would not like to initiate discovery too often. On the other hand, not discovering reasonably often entail"},"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":"1009.4672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-23T18:13:16Z","cross_cats_sorted":[],"title_canon_sha256":"4dc4b2c34641d3d713f237768de84f6ba1365c66a4497df9f86a6d1714a0ed60","abstract_canon_sha256":"458bb1124503a0e9eac1658b8e1e6b9e5f8de93515cf6aa5749ed7a5f4b32ff7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:21.919529Z","signature_b64":"IVESpCfxIWDFbnd/ERrpZSzALc8kVpXo2+FMlFnK/xtWdBXUctb9KMRvfvN9mjwzLyT2iIcxZDCbtCh5q9CzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5789cb35a33b3aecfefa8589bea704b32a803f3b91ad890b3bdb7e94436eded8","last_reissued_at":"2026-05-18T04:40:21.918862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:21.918862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Threshold Policy for Route Discovery Initiation in Mobile Ad hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Joy Kuri, Tapas Kumar Patra","submitted_at":"2010-09-23T18:13:16Z","abstract_excerpt":"Achieving optimal transmission throughput in data networks in a multi-hop wireless networks is fundamental but hard problem. The situation is aggravated when nodes are mobile. Further, multi-rate system make the analysis of throughput more complicated. In mobile scenario, link may break or be created as nodes are moving within communication range. `Route Discovery' which is to find the optimal route and transmission schedule is an important issue. Route discovery entails some cost; so one would not like to initiate discovery too often. On the other hand, not discovering reasonably often entail"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4672","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":"1009.4672","created_at":"2026-05-18T04:40:21.918966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.4672v1","created_at":"2026-05-18T04:40:21.918966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4672","created_at":"2026-05-18T04:40:21.918966+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6E4WNNDHM5O","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6E4WNNDHM5OZ7X2","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6E4WNND","created_at":"2026-05-18T12:26:09.077623+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/K6E4WNNDHM5OZ7X2QWE35JYEWM","json":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM.json","graph_json":"https://pith.science/api/pith-number/K6E4WNNDHM5OZ7X2QWE35JYEWM/graph.json","events_json":"https://pith.science/api/pith-number/K6E4WNNDHM5OZ7X2QWE35JYEWM/events.json","paper":"https://pith.science/paper/K6E4WNND"},"agent_actions":{"view_html":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM","download_json":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM.json","view_paper":"https://pith.science/paper/K6E4WNND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.4672&json=true","fetch_graph":"https://pith.science/api/pith-number/K6E4WNNDHM5OZ7X2QWE35JYEWM/graph.json","fetch_events":"https://pith.science/api/pith-number/K6E4WNNDHM5OZ7X2QWE35JYEWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM/action/storage_attestation","attest_author":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM/action/author_attestation","sign_citation":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM/action/citation_signature","submit_replication":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM/action/replication_record"}},"created_at":"2026-05-18T04:40:21.918966+00:00","updated_at":"2026-05-18T04:40:21.918966+00:00"}