{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LRFBAVA7USGE7GKFMDR5A72LIW","short_pith_number":"pith:LRFBAVA7","canonical_record":{"source":{"id":"1705.02552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-07T02:42:32Z","cross_cats_sorted":[],"title_canon_sha256":"67abbe75a284e9676ca0c2cbe36be8335cf5038dc73e16456787ff2118b7d698","abstract_canon_sha256":"a91e46b104794e8f0419616915de4aa6667d7b7e1cc08627c3a0ea8ab0b49a21"},"schema_version":"1.0"},"canonical_sha256":"5c4a10541fa48c4f994560e3d07f4b4584caa65d4ce2141ae6489fda87654d33","source":{"kind":"arxiv","id":"1705.02552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02552","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02552v1","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02552","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"pith_short_12","alias_value":"LRFBAVA7USGE","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LRFBAVA7USGE7GKF","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LRFBAVA7","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LRFBAVA7USGE7GKFMDR5A72LIW","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-07T02:42:32Z","cross_cats_sorted":[],"title_canon_sha256":"67abbe75a284e9676ca0c2cbe36be8335cf5038dc73e16456787ff2118b7d698","abstract_canon_sha256":"a91e46b104794e8f0419616915de4aa6667d7b7e1cc08627c3a0ea8ab0b49a21"},"schema_version":"1.0"},"canonical_sha256":"5c4a10541fa48c4f994560e3d07f4b4584caa65d4ce2141ae6489fda87654d33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:47.889457Z","signature_b64":"4NvYBOZqRpAMxCp7owWl9Fo2tgVqG0TsXF+z3cw7OZBm60s6SxbPqmnWvjSuTPx5setO5Qlrbla75vkNux0rDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c4a10541fa48c4f994560e3d07f4b4584caa65d4ce2141ae6489fda87654d33","last_reissued_at":"2026-05-18T00:43:47.888941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:47.888941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02552","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:43:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C4bmrVr3Ivs2xb03M/3hDXFSRBIYZi2Rjhzf3/9R3Pv4APNlXVds75slMJ4i4D49wjAmBO6d2nBIe0k6Ce87Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:40:05.810468Z"},"content_sha256":"0f91da22f895df8c6de3af259850b4bc853418064ad68994bf4fcd497a42e66b","schema_version":"1.0","event_id":"sha256:0f91da22f895df8c6de3af259850b4bc853418064ad68994bf4fcd497a42e66b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LRFBAVA7USGE7GKFMDR5A72LIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Routing in Mobile Ad-Hoc Networks using Social Tie Strengths and Mobility Plans","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Mario Gerla, Niyant Krishnamurthi, Riten Gupta, Tejaswi Tamminedi, Uen-Tao Wang","submitted_at":"2017-05-07T02:42:32Z","abstract_excerpt":"We consider the problem of routing in a mobile ad-hoc network (MANET) for which the planned mobilities of the nodes are partially known a priori and the nodes travel in groups. This situation arises commonly in military and emergency response scenarios. Optimal routes are computed using the most reliable path principle in which the negative logarithm of a node pair's adjacency probability is used as a link weight metric. This probability is estimated using the mobility plan as well as dynamic information captured by table exchanges, including a measure of the social tie strength between nodes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02552","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:43:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYxB9PSFiC8c1Trx9X0XXuGzOL6PqsxwcNP3+4fVpJSe82R/NiqufKNdHtGdojkHDtCU34Hgn0ws4Y9JPR5DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:40:05.810816Z"},"content_sha256":"099a21674fa39a7c108b5f777301b27b9ab5f4d3e3f7a533d7c70a2cb1c9a159","schema_version":"1.0","event_id":"sha256:099a21674fa39a7c108b5f777301b27b9ab5f4d3e3f7a533d7c70a2cb1c9a159"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LRFBAVA7USGE7GKFMDR5A72LIW/bundle.json","state_url":"https://pith.science/pith/LRFBAVA7USGE7GKFMDR5A72LIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LRFBAVA7USGE7GKFMDR5A72LIW/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-02T21:40:05Z","links":{"resolver":"https://pith.science/pith/LRFBAVA7USGE7GKFMDR5A72LIW","bundle":"https://pith.science/pith/LRFBAVA7USGE7GKFMDR5A72LIW/bundle.json","state":"https://pith.science/pith/LRFBAVA7USGE7GKFMDR5A72LIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LRFBAVA7USGE7GKFMDR5A72LIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LRFBAVA7USGE7GKFMDR5A72LIW","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":"a91e46b104794e8f0419616915de4aa6667d7b7e1cc08627c3a0ea8ab0b49a21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-07T02:42:32Z","title_canon_sha256":"67abbe75a284e9676ca0c2cbe36be8335cf5038dc73e16456787ff2118b7d698"},"schema_version":"1.0","source":{"id":"1705.02552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02552","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02552v1","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02552","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"pith_short_12","alias_value":"LRFBAVA7USGE","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LRFBAVA7USGE7GKF","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LRFBAVA7","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:099a21674fa39a7c108b5f777301b27b9ab5f4d3e3f7a533d7c70a2cb1c9a159","target":"graph","created_at":"2026-05-18T00:43:47Z","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":"We consider the problem of routing in a mobile ad-hoc network (MANET) for which the planned mobilities of the nodes are partially known a priori and the nodes travel in groups. This situation arises commonly in military and emergency response scenarios. Optimal routes are computed using the most reliable path principle in which the negative logarithm of a node pair's adjacency probability is used as a link weight metric. This probability is estimated using the mobility plan as well as dynamic information captured by table exchanges, including a measure of the social tie strength between nodes.","authors_text":"Mario Gerla, Niyant Krishnamurthi, Riten Gupta, Tejaswi Tamminedi, Uen-Tao Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-07T02:42:32Z","title":"Routing in Mobile Ad-Hoc Networks using Social Tie Strengths and Mobility Plans"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02552","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:0f91da22f895df8c6de3af259850b4bc853418064ad68994bf4fcd497a42e66b","target":"record","created_at":"2026-05-18T00:43:47Z","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":"a91e46b104794e8f0419616915de4aa6667d7b7e1cc08627c3a0ea8ab0b49a21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-07T02:42:32Z","title_canon_sha256":"67abbe75a284e9676ca0c2cbe36be8335cf5038dc73e16456787ff2118b7d698"},"schema_version":"1.0","source":{"id":"1705.02552","kind":"arxiv","version":1}},"canonical_sha256":"5c4a10541fa48c4f994560e3d07f4b4584caa65d4ce2141ae6489fda87654d33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c4a10541fa48c4f994560e3d07f4b4584caa65d4ce2141ae6489fda87654d33","first_computed_at":"2026-05-18T00:43:47.888941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:47.888941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4NvYBOZqRpAMxCp7owWl9Fo2tgVqG0TsXF+z3cw7OZBm60s6SxbPqmnWvjSuTPx5setO5Qlrbla75vkNux0rDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:47.889457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f91da22f895df8c6de3af259850b4bc853418064ad68994bf4fcd497a42e66b","sha256:099a21674fa39a7c108b5f777301b27b9ab5f4d3e3f7a533d7c70a2cb1c9a159"],"state_sha256":"082b1dfe53c52f6f8105810afa04d1a9b45058bc051fee0b6c50a2c1c972b545"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ch94XEQv01u7/9ueyvHzxw6ZfhJm+j/SWB7zLmNa+FD85Q0J2uyeTw1JlnqDYTQ8xUNVllSUe90BB2T8yIQFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:40:05.812802Z","bundle_sha256":"e70a0c958c48f63997db842703fbfd5033aea3710c74e13bed0a4345475a8da1"}}