{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QSBVHT474YU642A2TKBKVLFD7W","short_pith_number":"pith:QSBVHT47","canonical_record":{"source":{"id":"1601.03555","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-14T11:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"bb7a1597e15d16e9e81d3002a15f06aa800063d16cc520a891be87032d2d6e15","abstract_canon_sha256":"495b89bdae133e5e5d5b191a676cb41069ceb61c704b97d647fc1fd90aad23bd"},"schema_version":"1.0"},"canonical_sha256":"848353cf9fe629ee681a9a82aaaca3fd84911dc60f7508c4c636d342713bd1e1","source":{"kind":"arxiv","id":"1601.03555","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03555","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03555v2","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03555","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"QSBVHT474YU6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QSBVHT474YU642A2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QSBVHT47","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QSBVHT474YU642A2TKBKVLFD7W","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03555","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-14T11:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"bb7a1597e15d16e9e81d3002a15f06aa800063d16cc520a891be87032d2d6e15","abstract_canon_sha256":"495b89bdae133e5e5d5b191a676cb41069ceb61c704b97d647fc1fd90aad23bd"},"schema_version":"1.0"},"canonical_sha256":"848353cf9fe629ee681a9a82aaaca3fd84911dc60f7508c4c636d342713bd1e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:38.349054Z","signature_b64":"2lYxIDdxHeRc0aKP7J4KF4w1i3SwzIECEm1iksxE9F0y883M3mu204sNKlp8Outta7toVFDWwPEy/fakXQ3jBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"848353cf9fe629ee681a9a82aaaca3fd84911dc60f7508c4c636d342713bd1e1","last_reissued_at":"2026-05-18T01:15:38.348387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:38.348387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03555","source_version":2,"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:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvk/OLyijVHSa/ntxHDA4FWREJOJSw4hFjS78AbPO2QBUzrkQBklujglSbibUcLdTrFR5ZYSHDzLw0CE8gRHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:47:54.802762Z"},"content_sha256":"12f0ae3d3e5ea369efb1688d235af6e93c4174594ab29034a9eb34c9868f0aa0","schema_version":"1.0","event_id":"sha256:12f0ae3d3e5ea369efb1688d235af6e93c4174594ab29034a9eb34c9868f0aa0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QSBVHT474YU642A2TKBKVLFD7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Geographic Multi-Copy Routing Scheme for DTNs With Heterogeneous Mobility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Geyong Min, Jian Weng, Kaimin Wei, Xin Yang, Yue Cao, Zhili Sun","submitted_at":"2016-01-14T11:10:44Z","abstract_excerpt":"Previous geographic routing schemes in Delay/Disruption Tolerant Networks (DTNs) only consider the homogeneous scenario where nodal mobility is identical. Motivated by this gap, we turn to design a DTN based geographic routing scheme in heterogeneous scenario. Systematically, our target is achieved via two steps: 1) We first propose \"The-Best-Geographic-Relay (TBGR)\" routing scheme to relay messages via a limited number of copies, under the homogeneous scenario. We further overcome the local maximum problem of TBGR given a sparse network density, different from those efforts in dense networks "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03555","kind":"arxiv","version":2},"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:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GAep8+3MdI7clM1SAwz+s0ybc/Zd0+eGr3p3+/rLTCp8oibOwWTnrLf8Bjp6BgJiE1qBddRiebh7dW3W4GT0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:47:54.803112Z"},"content_sha256":"79eafdb722282061c795274388159362498eef88b4bc252c0dff8ef68f878f77","schema_version":"1.0","event_id":"sha256:79eafdb722282061c795274388159362498eef88b4bc252c0dff8ef68f878f77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W/bundle.json","state_url":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSBVHT474YU642A2TKBKVLFD7W/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-05-24T23:47:54Z","links":{"resolver":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W","bundle":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W/bundle.json","state":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSBVHT474YU642A2TKBKVLFD7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QSBVHT474YU642A2TKBKVLFD7W","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":"495b89bdae133e5e5d5b191a676cb41069ceb61c704b97d647fc1fd90aad23bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-14T11:10:44Z","title_canon_sha256":"bb7a1597e15d16e9e81d3002a15f06aa800063d16cc520a891be87032d2d6e15"},"schema_version":"1.0","source":{"id":"1601.03555","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03555","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03555v2","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03555","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"QSBVHT474YU6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QSBVHT474YU642A2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QSBVHT47","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:79eafdb722282061c795274388159362498eef88b4bc252c0dff8ef68f878f77","target":"graph","created_at":"2026-05-18T01:15:38Z","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":"Previous geographic routing schemes in Delay/Disruption Tolerant Networks (DTNs) only consider the homogeneous scenario where nodal mobility is identical. Motivated by this gap, we turn to design a DTN based geographic routing scheme in heterogeneous scenario. Systematically, our target is achieved via two steps: 1) We first propose \"The-Best-Geographic-Relay (TBGR)\" routing scheme to relay messages via a limited number of copies, under the homogeneous scenario. We further overcome the local maximum problem of TBGR given a sparse network density, different from those efforts in dense networks ","authors_text":"Geyong Min, Jian Weng, Kaimin Wei, Xin Yang, Yue Cao, Zhili Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-14T11:10:44Z","title":"A Geographic Multi-Copy Routing Scheme for DTNs With Heterogeneous Mobility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03555","kind":"arxiv","version":2},"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:12f0ae3d3e5ea369efb1688d235af6e93c4174594ab29034a9eb34c9868f0aa0","target":"record","created_at":"2026-05-18T01:15:38Z","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":"495b89bdae133e5e5d5b191a676cb41069ceb61c704b97d647fc1fd90aad23bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-14T11:10:44Z","title_canon_sha256":"bb7a1597e15d16e9e81d3002a15f06aa800063d16cc520a891be87032d2d6e15"},"schema_version":"1.0","source":{"id":"1601.03555","kind":"arxiv","version":2}},"canonical_sha256":"848353cf9fe629ee681a9a82aaaca3fd84911dc60f7508c4c636d342713bd1e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"848353cf9fe629ee681a9a82aaaca3fd84911dc60f7508c4c636d342713bd1e1","first_computed_at":"2026-05-18T01:15:38.348387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:38.348387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2lYxIDdxHeRc0aKP7J4KF4w1i3SwzIECEm1iksxE9F0y883M3mu204sNKlp8Outta7toVFDWwPEy/fakXQ3jBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:38.349054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03555","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12f0ae3d3e5ea369efb1688d235af6e93c4174594ab29034a9eb34c9868f0aa0","sha256:79eafdb722282061c795274388159362498eef88b4bc252c0dff8ef68f878f77"],"state_sha256":"5f48f966ecf9da642c2b65a515da79df743f965201475961aa48484ec171aca9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KrsIo5+TsKrqJOjW3MiI/uvCx2EP19VerVxrwV+2o1GHl+wvLAEWXDwKPBpYVJ4Y0kUSdLph4bnNSzWuXlyCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T23:47:54.805710Z","bundle_sha256":"93f92d7e1ce2fbfb2336eeea1ab3048fe99ab0c00ac70acdb82fbfca9c299ad1"}}