{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QSBVHT474YU642A2TKBKVLFD7W","short_pith_number":"pith:QSBVHT47","schema_version":"1.0","canonical_sha256":"848353cf9fe629ee681a9a82aaaca3fd84911dc60f7508c4c636d342713bd1e1","source":{"kind":"arxiv","id":"1601.03555","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.03555","created_at":"2026-05-18T01:15:38.348487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03555v2","created_at":"2026-05-18T01:15:38.348487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03555","created_at":"2026-05-18T01:15:38.348487+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSBVHT474YU6","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSBVHT474YU642A2","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSBVHT47","created_at":"2026-05-18T12:30:41.710351+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/QSBVHT474YU642A2TKBKVLFD7W","json":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W.json","graph_json":"https://pith.science/api/pith-number/QSBVHT474YU642A2TKBKVLFD7W/graph.json","events_json":"https://pith.science/api/pith-number/QSBVHT474YU642A2TKBKVLFD7W/events.json","paper":"https://pith.science/paper/QSBVHT47"},"agent_actions":{"view_html":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W","download_json":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W.json","view_paper":"https://pith.science/paper/QSBVHT47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03555&json=true","fetch_graph":"https://pith.science/api/pith-number/QSBVHT474YU642A2TKBKVLFD7W/graph.json","fetch_events":"https://pith.science/api/pith-number/QSBVHT474YU642A2TKBKVLFD7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W/action/storage_attestation","attest_author":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W/action/author_attestation","sign_citation":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W/action/citation_signature","submit_replication":"https://pith.science/pith/QSBVHT474YU642A2TKBKVLFD7W/action/replication_record"}},"created_at":"2026-05-18T01:15:38.348487+00:00","updated_at":"2026-05-18T01:15:38.348487+00:00"}