{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3F2YMPXZLUO6VGP2FOYBYRIT6G","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":"5958ba31c068fcd24d54e6673cd0fd1875adf494031c67aa543f709cfa957d81","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T19:53:50Z","title_canon_sha256":"d961e24d4a4834eb7dbeff305e940663d0693ab7a0e46061867cb5edce1bead4"},"schema_version":"1.0","source":{"id":"1602.08455","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08455","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08455v2","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08455","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"3F2YMPXZLUO6","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3F2YMPXZLUO6VGP2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3F2YMPXZ","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:b025e203f76dba8e6cd57a31b9b96651440cb7237b6261fc0a0f4845ecf720db","target":"graph","created_at":"2026-05-18T00:41:53Z","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":"Social Delay Tolerant Networks (SDTNs) are a special kind of Delay Tolerant Network (DTN) that consists of a number of mobile devices with social characteristics. The current research achievements on routing algorithms tend to separately evaluate the available profit for each prospective relay node and cannot achieve the global optimal performance in an overall perspective. In this paper, we propose a Movement Pattern-Aware optimal Routing (MPAR) for SDTNs, by choosing the optimal relay node(s) set for each message, which eventually based on running a search algorithm on a hyper-cube solution ","authors_text":"Changjiang Wei, Jianbo Li, Lei You, Lejuan Hu","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T19:53:50Z","title":"MPAR: A Movement Pattern-Aware Optimal Routing for Social Delay Tolerant Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08455","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:e2d89fe058ff5a11816c8109e079ddf4c105caf298fab81fcfca75ba3caa1cd3","target":"record","created_at":"2026-05-18T00:41:53Z","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":"5958ba31c068fcd24d54e6673cd0fd1875adf494031c67aa543f709cfa957d81","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T19:53:50Z","title_canon_sha256":"d961e24d4a4834eb7dbeff305e940663d0693ab7a0e46061867cb5edce1bead4"},"schema_version":"1.0","source":{"id":"1602.08455","kind":"arxiv","version":2}},"canonical_sha256":"d975863ef95d1dea99fa2bb01c4513f186b7529a19c1d500a1211cad755e09b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d975863ef95d1dea99fa2bb01c4513f186b7529a19c1d500a1211cad755e09b7","first_computed_at":"2026-05-18T00:41:53.735596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:53.735596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ydbu0QbrohPyvFQnLklomCWRemxw5hC1nLa2u+ULMI5H70+GTZJgrEky2zZ4eiHEGCKJH7R0EiF2R0/KYHVoBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:53.736339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08455","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2d89fe058ff5a11816c8109e079ddf4c105caf298fab81fcfca75ba3caa1cd3","sha256:b025e203f76dba8e6cd57a31b9b96651440cb7237b6261fc0a0f4845ecf720db"],"state_sha256":"e431114d768330173d8596fe3261b883ec58abd9f68c9eee5e8ba650c04f9e95"}