{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZOFMI2A2WJIKOFXM7SRKKA25BI","short_pith_number":"pith:ZOFMI2A2","canonical_record":{"source":{"id":"1608.08725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-08-31T04:26:56Z","cross_cats_sorted":[],"title_canon_sha256":"7a3baa0cd681205bb788948c0e5fe1af57dbf19f70418b2e648c35526262dae8","abstract_canon_sha256":"a18df6954dd30da7012c9d355f8181c4c566e6c8f15ddb6e9b9dd5ff4fba8450"},"schema_version":"1.0"},"canonical_sha256":"cb8ac4681ab250a716ecfca2a5035d0a062eb72dd49b70ce64fdc7f5b701860d","source":{"kind":"arxiv","id":"1608.08725","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08725","created_at":"2026-05-18T01:06:40Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08725v1","created_at":"2026-05-18T01:06:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08725","created_at":"2026-05-18T01:06:40Z"},{"alias_kind":"pith_short_12","alias_value":"ZOFMI2A2WJIK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZOFMI2A2WJIKOFXM","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZOFMI2A2","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZOFMI2A2WJIKOFXM7SRKKA25BI","target":"record","payload":{"canonical_record":{"source":{"id":"1608.08725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-08-31T04:26:56Z","cross_cats_sorted":[],"title_canon_sha256":"7a3baa0cd681205bb788948c0e5fe1af57dbf19f70418b2e648c35526262dae8","abstract_canon_sha256":"a18df6954dd30da7012c9d355f8181c4c566e6c8f15ddb6e9b9dd5ff4fba8450"},"schema_version":"1.0"},"canonical_sha256":"cb8ac4681ab250a716ecfca2a5035d0a062eb72dd49b70ce64fdc7f5b701860d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:40.083912Z","signature_b64":"zLWw2QM5WMfBdy9p47onnvMqVwtjZC7B4HP0qczzlcib8JPoCwp8aFOrel4BC600BpMWrY3eME+DJkrouvqbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb8ac4681ab250a716ecfca2a5035d0a062eb72dd49b70ce64fdc7f5b701860d","last_reissued_at":"2026-05-18T01:06:40.083169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:40.083169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.08725","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-18T01:06:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WiXvIOxY3/Wq9PgQUiJU8ABCkk8qq3D4QiSv7ZwL4g28pWHTbZrQxqg83Ek0Oa2dn10v+QuTZ8GZLpjwd9/mBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:23:41.405222Z"},"content_sha256":"017f1442b17a8097d6a752bf219264716ec1b9db841ea5d57098936c405d282c","schema_version":"1.0","event_id":"sha256:017f1442b17a8097d6a752bf219264716ec1b9db841ea5d57098936c405d282c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZOFMI2A2WJIKOFXM7SRKKA25BI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Making On-Demand Routing Efficient with Route-Request Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"J.J. Garcia-Luna-Aceves, Maziar Mirzazad-Barijough","submitted_at":"2016-08-31T04:26:56Z","abstract_excerpt":"In theory, on-demand routing is very attractive for mobile ad hoc networks (MANET), because it induces signaling only for those destinations for which there is data traffic. However, in practice, the signaling overhead of existing on-demand routing protocols becomes excessive as the rate of topology changes increases due to mobility or other causes. We introduce the first on-demand routing approach that eliminates the main limitation of on-demand routing by aggregating route requests (RREQ) for the same destinations. The approach can be applied to any existing on-demand routing protocol, and w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08725","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-18T01:06:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OU+UBSIu5rWKEDImoq+tYPNWrcrsU+KBWKIql0d5a2BKi+8wvM3aEti0OXBNw/Lj8LCAmN81xAUGPWufAyLfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:23:41.405966Z"},"content_sha256":"6a8d503f9ce59ae167e26e3eccb848a3706bf6fa846083415747eab26d36f491","schema_version":"1.0","event_id":"sha256:6a8d503f9ce59ae167e26e3eccb848a3706bf6fa846083415747eab26d36f491"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZOFMI2A2WJIKOFXM7SRKKA25BI/bundle.json","state_url":"https://pith.science/pith/ZOFMI2A2WJIKOFXM7SRKKA25BI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZOFMI2A2WJIKOFXM7SRKKA25BI/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-08T03:23:41Z","links":{"resolver":"https://pith.science/pith/ZOFMI2A2WJIKOFXM7SRKKA25BI","bundle":"https://pith.science/pith/ZOFMI2A2WJIKOFXM7SRKKA25BI/bundle.json","state":"https://pith.science/pith/ZOFMI2A2WJIKOFXM7SRKKA25BI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZOFMI2A2WJIKOFXM7SRKKA25BI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZOFMI2A2WJIKOFXM7SRKKA25BI","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":"a18df6954dd30da7012c9d355f8181c4c566e6c8f15ddb6e9b9dd5ff4fba8450","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-08-31T04:26:56Z","title_canon_sha256":"7a3baa0cd681205bb788948c0e5fe1af57dbf19f70418b2e648c35526262dae8"},"schema_version":"1.0","source":{"id":"1608.08725","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08725","created_at":"2026-05-18T01:06:40Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08725v1","created_at":"2026-05-18T01:06:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08725","created_at":"2026-05-18T01:06:40Z"},{"alias_kind":"pith_short_12","alias_value":"ZOFMI2A2WJIK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZOFMI2A2WJIKOFXM","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZOFMI2A2","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:6a8d503f9ce59ae167e26e3eccb848a3706bf6fa846083415747eab26d36f491","target":"graph","created_at":"2026-05-18T01:06:40Z","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 theory, on-demand routing is very attractive for mobile ad hoc networks (MANET), because it induces signaling only for those destinations for which there is data traffic. However, in practice, the signaling overhead of existing on-demand routing protocols becomes excessive as the rate of topology changes increases due to mobility or other causes. We introduce the first on-demand routing approach that eliminates the main limitation of on-demand routing by aggregating route requests (RREQ) for the same destinations. The approach can be applied to any existing on-demand routing protocol, and w","authors_text":"J.J. Garcia-Luna-Aceves, Maziar Mirzazad-Barijough","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-08-31T04:26:56Z","title":"Making On-Demand Routing Efficient with Route-Request Aggregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08725","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:017f1442b17a8097d6a752bf219264716ec1b9db841ea5d57098936c405d282c","target":"record","created_at":"2026-05-18T01:06:40Z","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":"a18df6954dd30da7012c9d355f8181c4c566e6c8f15ddb6e9b9dd5ff4fba8450","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-08-31T04:26:56Z","title_canon_sha256":"7a3baa0cd681205bb788948c0e5fe1af57dbf19f70418b2e648c35526262dae8"},"schema_version":"1.0","source":{"id":"1608.08725","kind":"arxiv","version":1}},"canonical_sha256":"cb8ac4681ab250a716ecfca2a5035d0a062eb72dd49b70ce64fdc7f5b701860d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb8ac4681ab250a716ecfca2a5035d0a062eb72dd49b70ce64fdc7f5b701860d","first_computed_at":"2026-05-18T01:06:40.083169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:40.083169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zLWw2QM5WMfBdy9p47onnvMqVwtjZC7B4HP0qczzlcib8JPoCwp8aFOrel4BC600BpMWrY3eME+DJkrouvqbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:40.083912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08725","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:017f1442b17a8097d6a752bf219264716ec1b9db841ea5d57098936c405d282c","sha256:6a8d503f9ce59ae167e26e3eccb848a3706bf6fa846083415747eab26d36f491"],"state_sha256":"9f21945fb1bf603a6fd2626511a5eb362ec0686aa5c9ca0af100b5bfff752a8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzEVqorZ7mwybEc0iXJhFf37PfZBPGb9aAhw1OWddyaHQ4iDkVtjX0S6C9+LR2xWT80MNSt+MrXsD2Egd93lBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:23:41.409384Z","bundle_sha256":"869b317da0021acebada7621d70a48301bacee157cecda1d0d5d000e2bd0f80f"}}