{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:K6E4WNNDHM5OZ7X2QWE35JYEWM","short_pith_number":"pith:K6E4WNND","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"},"canonical_sha256":"5789cb35a33b3aecfefa8589bea704b32a803f3b91ad890b3bdb7e94436eded8","source":{"kind":"arxiv","id":"1009.4672","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4672","created_at":"2026-05-18T04:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4672v1","created_at":"2026-05-18T04:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4672","created_at":"2026-05-18T04:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"K6E4WNNDHM5O","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"K6E4WNNDHM5OZ7X2","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"K6E4WNND","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:K6E4WNNDHM5OZ7X2QWE35JYEWM","target":"record","payload":{"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"},"canonical_sha256":"5789cb35a33b3aecfefa8589bea704b32a803f3b91ad890b3bdb7e94436eded8","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"},"source_kind":"arxiv","source_id":"1009.4672","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-18T04:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCZf01eVEm8UShEj7W6Yn+QXG0bLM3glCOLZtfwCVBqttBcLHQOsacXBMtTvVZH4c6ACG+3fJxE2vOrK5R89BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:09:01.904204Z"},"content_sha256":"4baf5ea7cb40f62661b34c67497fffff4b0dd2f87f2b798195482e3bfd179318","schema_version":"1.0","event_id":"sha256:4baf5ea7cb40f62661b34c67497fffff4b0dd2f87f2b798195482e3bfd179318"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:K6E4WNNDHM5OZ7X2QWE35JYEWM","target":"graph","payload":{"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"},"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-18T04:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yFVJT9Cwt3n98BQFWxOlp7kbRG2670kIPrt5a8wM+W0kQ/YvC09GUityjM7NcwHl71JfFUafkfXEk6Tr/FOoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:09:01.904565Z"},"content_sha256":"78b32207de173db7f2ed52a08e85e37ce5556ca1ea108e2a44905b0e254507e6","schema_version":"1.0","event_id":"sha256:78b32207de173db7f2ed52a08e85e37ce5556ca1ea108e2a44905b0e254507e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM/bundle.json","state_url":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM/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-29T13:09:01Z","links":{"resolver":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM","bundle":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM/bundle.json","state":"https://pith.science/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6E4WNNDHM5OZ7X2QWE35JYEWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:K6E4WNNDHM5OZ7X2QWE35JYEWM","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":"458bb1124503a0e9eac1658b8e1e6b9e5f8de93515cf6aa5749ed7a5f4b32ff7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-23T18:13:16Z","title_canon_sha256":"4dc4b2c34641d3d713f237768de84f6ba1365c66a4497df9f86a6d1714a0ed60"},"schema_version":"1.0","source":{"id":"1009.4672","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4672","created_at":"2026-05-18T04:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4672v1","created_at":"2026-05-18T04:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4672","created_at":"2026-05-18T04:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"K6E4WNNDHM5O","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"K6E4WNNDHM5OZ7X2","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"K6E4WNND","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:78b32207de173db7f2ed52a08e85e37ce5556ca1ea108e2a44905b0e254507e6","target":"graph","created_at":"2026-05-18T04:40:21Z","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":"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","authors_text":"Joy Kuri, Tapas Kumar Patra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-23T18:13:16Z","title":"Threshold Policy for Route Discovery Initiation in Mobile Ad hoc Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4672","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:4baf5ea7cb40f62661b34c67497fffff4b0dd2f87f2b798195482e3bfd179318","target":"record","created_at":"2026-05-18T04:40:21Z","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":"458bb1124503a0e9eac1658b8e1e6b9e5f8de93515cf6aa5749ed7a5f4b32ff7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-23T18:13:16Z","title_canon_sha256":"4dc4b2c34641d3d713f237768de84f6ba1365c66a4497df9f86a6d1714a0ed60"},"schema_version":"1.0","source":{"id":"1009.4672","kind":"arxiv","version":1}},"canonical_sha256":"5789cb35a33b3aecfefa8589bea704b32a803f3b91ad890b3bdb7e94436eded8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5789cb35a33b3aecfefa8589bea704b32a803f3b91ad890b3bdb7e94436eded8","first_computed_at":"2026-05-18T04:40:21.918862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:21.918862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IVESpCfxIWDFbnd/ERrpZSzALc8kVpXo2+FMlFnK/xtWdBXUctb9KMRvfvN9mjwzLyT2iIcxZDCbtCh5q9CzDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:21.919529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4672","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4baf5ea7cb40f62661b34c67497fffff4b0dd2f87f2b798195482e3bfd179318","sha256:78b32207de173db7f2ed52a08e85e37ce5556ca1ea108e2a44905b0e254507e6"],"state_sha256":"c36c1f8f89e9e188e270d871b216b559b00d73c0647e687163f65cba529f8200"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D8d9MWrfvC0QPXKNVP2VdTfhl6pK7Fgfa5hDn2eSMalYHRQPhBHfrAFw/xhPG9R2hQoGfeyaajtDdXFSH+rsDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:09:01.906415Z","bundle_sha256":"a667e5c8a927c32e888a41dfa60d469ab20b051f75b05295d7df5c4267327b4e"}}