{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D5OLGHMR6CD4UXJX6OP74NTSJH","short_pith_number":"pith:D5OLGHMR","canonical_record":{"source":{"id":"1501.07754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-30T12:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"f75b59c312a5c4da6535002c5911699a011cef1c732538c9e7a03f88b1a96b80","abstract_canon_sha256":"60129487013e5d47ce828c21e1474a4bf7a7143e3edbce4305a27260baae5d3a"},"schema_version":"1.0"},"canonical_sha256":"1f5cb31d91f087ca5d37f39ffe367249ea5acd432d2f03096af821e3d9c4af5e","source":{"kind":"arxiv","id":"1501.07754","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07754","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07754v2","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07754","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"D5OLGHMR6CD4","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D5OLGHMR6CD4UXJX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D5OLGHMR","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D5OLGHMR6CD4UXJX6OP74NTSJH","target":"record","payload":{"canonical_record":{"source":{"id":"1501.07754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-30T12:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"f75b59c312a5c4da6535002c5911699a011cef1c732538c9e7a03f88b1a96b80","abstract_canon_sha256":"60129487013e5d47ce828c21e1474a4bf7a7143e3edbce4305a27260baae5d3a"},"schema_version":"1.0"},"canonical_sha256":"1f5cb31d91f087ca5d37f39ffe367249ea5acd432d2f03096af821e3d9c4af5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:43.823086Z","signature_b64":"9RpS0t/bJHR92VE6qFY1xq+SgFN+htWJQoGBof20QOAKjB0UEqW1ASfcQCageOaEP2a+ET66vjeyuQqIa6JICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f5cb31d91f087ca5d37f39ffe367249ea5acd432d2f03096af821e3d9c4af5e","last_reissued_at":"2026-05-18T02:27:43.822413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:43.822413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.07754","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-18T02:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1I8T1N2cZ9slXEZRK9kGg/xpy8vTRo8dJH23wO84BYwDbkaPUclEnCYMGnnkg+AqglH6Bi52JSvkOM/5ZwIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:58:54.314810Z"},"content_sha256":"1ac8cf4c43335dbcbd055e4ed6a5cecd838dcd8e1a19822a8f980434c52fa3e1","schema_version":"1.0","event_id":"sha256:1ac8cf4c43335dbcbd055e4ed6a5cecd838dcd8e1a19822a8f980434c52fa3e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D5OLGHMR6CD4UXJX6OP74NTSJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NFCU: A New Friendship-based Routing with Buffer Management in Opportunistic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Li Li, Xiaohan Zhang, Xiaoxiong Zhong, Yang Qin","submitted_at":"2015-01-30T12:48:12Z","abstract_excerpt":"Routing in opportunistic networks is a very important and challenging problem because opportunistic network utilizes the contact opportunities of mobile nodes to achieve data communication.Social-based routing uses behavior of human beings which can form a community with the same interests to deliver the message.In this paper,we analyze the drawbacks of the original friendship-based algorithm, which defined social pressure metric to determine nodes'friendship community, but the metric couldn't distinguish the distribution characterization of the connection length which has an important impact "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07754","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-18T02:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lhZtpx0fi7j3IfNq8agSYTyavKTb0cr3U9KE8g2185mrXbFbBdySHgB0nIV15Sc3pRlokeuhnytyDcR+ChODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:58:54.315159Z"},"content_sha256":"b01c417111e4ba850354cf6859a837894f631d7cda965a938cd598c93c175b9a","schema_version":"1.0","event_id":"sha256:b01c417111e4ba850354cf6859a837894f631d7cda965a938cd598c93c175b9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH/bundle.json","state_url":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5OLGHMR6CD4UXJX6OP74NTSJH/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-02T07:58:54Z","links":{"resolver":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH","bundle":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH/bundle.json","state":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5OLGHMR6CD4UXJX6OP74NTSJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D5OLGHMR6CD4UXJX6OP74NTSJH","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":"60129487013e5d47ce828c21e1474a4bf7a7143e3edbce4305a27260baae5d3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-30T12:48:12Z","title_canon_sha256":"f75b59c312a5c4da6535002c5911699a011cef1c732538c9e7a03f88b1a96b80"},"schema_version":"1.0","source":{"id":"1501.07754","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07754","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07754v2","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07754","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"D5OLGHMR6CD4","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D5OLGHMR6CD4UXJX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D5OLGHMR","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:b01c417111e4ba850354cf6859a837894f631d7cda965a938cd598c93c175b9a","target":"graph","created_at":"2026-05-18T02:27:43Z","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":"Routing in opportunistic networks is a very important and challenging problem because opportunistic network utilizes the contact opportunities of mobile nodes to achieve data communication.Social-based routing uses behavior of human beings which can form a community with the same interests to deliver the message.In this paper,we analyze the drawbacks of the original friendship-based algorithm, which defined social pressure metric to determine nodes'friendship community, but the metric couldn't distinguish the distribution characterization of the connection length which has an important impact ","authors_text":"Li Li, Xiaohan Zhang, Xiaoxiong Zhong, Yang Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-30T12:48:12Z","title":"NFCU: A New Friendship-based Routing with Buffer Management in Opportunistic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07754","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:1ac8cf4c43335dbcbd055e4ed6a5cecd838dcd8e1a19822a8f980434c52fa3e1","target":"record","created_at":"2026-05-18T02:27:43Z","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":"60129487013e5d47ce828c21e1474a4bf7a7143e3edbce4305a27260baae5d3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-30T12:48:12Z","title_canon_sha256":"f75b59c312a5c4da6535002c5911699a011cef1c732538c9e7a03f88b1a96b80"},"schema_version":"1.0","source":{"id":"1501.07754","kind":"arxiv","version":2}},"canonical_sha256":"1f5cb31d91f087ca5d37f39ffe367249ea5acd432d2f03096af821e3d9c4af5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f5cb31d91f087ca5d37f39ffe367249ea5acd432d2f03096af821e3d9c4af5e","first_computed_at":"2026-05-18T02:27:43.822413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:43.822413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9RpS0t/bJHR92VE6qFY1xq+SgFN+htWJQoGBof20QOAKjB0UEqW1ASfcQCageOaEP2a+ET66vjeyuQqIa6JICw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:43.823086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07754","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ac8cf4c43335dbcbd055e4ed6a5cecd838dcd8e1a19822a8f980434c52fa3e1","sha256:b01c417111e4ba850354cf6859a837894f631d7cda965a938cd598c93c175b9a"],"state_sha256":"32befd4a406026bceafa1de22aa9e04f7c11f24471b57f0ed9c694e006c6882a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFPHa+m25fn49KncjWDLNSWK+6gWZWx3t+IDS3yVGkp/cCoiZaBasRTJJQHbyBIUu+ChiFuuUY7y6vyLBWnWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:58:54.317174Z","bundle_sha256":"bb715a42e84aac7a1c6ec76c84805a43b5d11bc13814e1f20776b9e2122a97f3"}}