{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RTVIQVWMQ5ZTJCIT4KEZCBE3K4","short_pith_number":"pith:RTVIQVWM","canonical_record":{"source":{"id":"1601.01423","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2016-01-07T07:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"946e56ed83f13377c3f8a59923781de9cbb87a748dfcf454842959d62e9c3cff","abstract_canon_sha256":"aae8880102cb5cb7c173c2289054ea7c83f39c45830f9be74621cdc42dea1016"},"schema_version":"1.0"},"canonical_sha256":"8cea8856cc8773348913e28991049b571cfe150d9d4cc32c25274e3f9b9d228f","source":{"kind":"arxiv","id":"1601.01423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01423","created_at":"2026-05-18T01:23:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01423v1","created_at":"2026-05-18T01:23:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01423","created_at":"2026-05-18T01:23:13Z"},{"alias_kind":"pith_short_12","alias_value":"RTVIQVWMQ5ZT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RTVIQVWMQ5ZTJCIT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RTVIQVWM","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RTVIQVWMQ5ZTJCIT4KEZCBE3K4","target":"record","payload":{"canonical_record":{"source":{"id":"1601.01423","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2016-01-07T07:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"946e56ed83f13377c3f8a59923781de9cbb87a748dfcf454842959d62e9c3cff","abstract_canon_sha256":"aae8880102cb5cb7c173c2289054ea7c83f39c45830f9be74621cdc42dea1016"},"schema_version":"1.0"},"canonical_sha256":"8cea8856cc8773348913e28991049b571cfe150d9d4cc32c25274e3f9b9d228f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:13.717241Z","signature_b64":"cSJ1lZ/0Z/leNFUI2AU6K+QD9eD0MXv5ozzS0v1VKij5LyfiuuuGM025QfU8GR59HOn+IPAZ8EGa7U7UJaefCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cea8856cc8773348913e28991049b571cfe150d9d4cc32c25274e3f9b9d228f","last_reissued_at":"2026-05-18T01:23:13.716659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:13.716659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.01423","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:23:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2LCld5vac7SttymUOgUidZ/PDXSr8o+xym3K3M6ZsVi7TAzdP5ti5RGAKMpSD6VPHEMKJvZmnNUwChSu0iSCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:37:35.625608Z"},"content_sha256":"ee4a80fb226d350c4ee17bc3a626954c668b98e0b9fbd5c194a4c2fde43f5c23","schema_version":"1.0","event_id":"sha256:ee4a80fb226d350c4ee17bc3a626954c668b98e0b9fbd5c194a4c2fde43f5c23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RTVIQVWMQ5ZTJCIT4KEZCBE3K4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Routing Mechanism Based on Social Networks and Betweenness Centrality in Delay-Tolerant Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Huijuan Zhang, Kai Liu","submitted_at":"2016-01-07T07:32:16Z","abstract_excerpt":"With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing scheme based on social networks owing to the fact that nodes in computer networks and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01423","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:23:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7XYcMZWhjOL6GB+QkfInLRIfY4GcSVc/oKTloIdUwfnsSn6InRppH6zvrwrIq43FjOxXgBS543h5lqXZzGftDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:37:35.626337Z"},"content_sha256":"47139c5ecd30713ac38b81411f489902cebcc770549fc5a18cefb5ca1b1eef1a","schema_version":"1.0","event_id":"sha256:47139c5ecd30713ac38b81411f489902cebcc770549fc5a18cefb5ca1b1eef1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTVIQVWMQ5ZTJCIT4KEZCBE3K4/bundle.json","state_url":"https://pith.science/pith/RTVIQVWMQ5ZTJCIT4KEZCBE3K4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTVIQVWMQ5ZTJCIT4KEZCBE3K4/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-07-02T06:37:35Z","links":{"resolver":"https://pith.science/pith/RTVIQVWMQ5ZTJCIT4KEZCBE3K4","bundle":"https://pith.science/pith/RTVIQVWMQ5ZTJCIT4KEZCBE3K4/bundle.json","state":"https://pith.science/pith/RTVIQVWMQ5ZTJCIT4KEZCBE3K4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTVIQVWMQ5ZTJCIT4KEZCBE3K4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RTVIQVWMQ5ZTJCIT4KEZCBE3K4","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":"aae8880102cb5cb7c173c2289054ea7c83f39c45830f9be74621cdc42dea1016","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2016-01-07T07:32:16Z","title_canon_sha256":"946e56ed83f13377c3f8a59923781de9cbb87a748dfcf454842959d62e9c3cff"},"schema_version":"1.0","source":{"id":"1601.01423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01423","created_at":"2026-05-18T01:23:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01423v1","created_at":"2026-05-18T01:23:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01423","created_at":"2026-05-18T01:23:13Z"},{"alias_kind":"pith_short_12","alias_value":"RTVIQVWMQ5ZT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RTVIQVWMQ5ZTJCIT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RTVIQVWM","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:47139c5ecd30713ac38b81411f489902cebcc770549fc5a18cefb5ca1b1eef1a","target":"graph","created_at":"2026-05-18T01:23:13Z","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":"With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing scheme based on social networks owing to the fact that nodes in computer networks and s","authors_text":"Huijuan Zhang, Kai Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2016-01-07T07:32:16Z","title":"A Routing Mechanism Based on Social Networks and Betweenness Centrality in Delay-Tolerant Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01423","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:ee4a80fb226d350c4ee17bc3a626954c668b98e0b9fbd5c194a4c2fde43f5c23","target":"record","created_at":"2026-05-18T01:23:13Z","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":"aae8880102cb5cb7c173c2289054ea7c83f39c45830f9be74621cdc42dea1016","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2016-01-07T07:32:16Z","title_canon_sha256":"946e56ed83f13377c3f8a59923781de9cbb87a748dfcf454842959d62e9c3cff"},"schema_version":"1.0","source":{"id":"1601.01423","kind":"arxiv","version":1}},"canonical_sha256":"8cea8856cc8773348913e28991049b571cfe150d9d4cc32c25274e3f9b9d228f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cea8856cc8773348913e28991049b571cfe150d9d4cc32c25274e3f9b9d228f","first_computed_at":"2026-05-18T01:23:13.716659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:13.716659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cSJ1lZ/0Z/leNFUI2AU6K+QD9eD0MXv5ozzS0v1VKij5LyfiuuuGM025QfU8GR59HOn+IPAZ8EGa7U7UJaefCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:13.717241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee4a80fb226d350c4ee17bc3a626954c668b98e0b9fbd5c194a4c2fde43f5c23","sha256:47139c5ecd30713ac38b81411f489902cebcc770549fc5a18cefb5ca1b1eef1a"],"state_sha256":"efef16eb603cc316f3b561d96f724d0dda055a7e0b82d75c1f96adab8f25da48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3DEfeTsWwdqT2uSgF+2Yaakeuqke/xOnWhCp04K4i5HrNh+4VgHjDiTEXxJlqkbYtBwH0c8NPuR/kXZsW+KsAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T06:37:35.628807Z","bundle_sha256":"00d212f7f967017d39bdfd9205b4ebdf54ee9593a96cf038304b9c970812b85d"}}