{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:D5OLGHMR6CD4UXJX6OP74NTSJH","short_pith_number":"pith:D5OLGHMR","schema_version":"1.0","canonical_sha256":"1f5cb31d91f087ca5d37f39ffe367249ea5acd432d2f03096af821e3d9c4af5e","source":{"kind":"arxiv","id":"1501.07754","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.07754","created_at":"2026-05-18T02:27:43.822523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07754v2","created_at":"2026-05-18T02:27:43.822523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07754","created_at":"2026-05-18T02:27:43.822523+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5OLGHMR6CD4","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5OLGHMR6CD4UXJX","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5OLGHMR","created_at":"2026-05-18T12:29:17.054201+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/D5OLGHMR6CD4UXJX6OP74NTSJH","json":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH.json","graph_json":"https://pith.science/api/pith-number/D5OLGHMR6CD4UXJX6OP74NTSJH/graph.json","events_json":"https://pith.science/api/pith-number/D5OLGHMR6CD4UXJX6OP74NTSJH/events.json","paper":"https://pith.science/paper/D5OLGHMR"},"agent_actions":{"view_html":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH","download_json":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH.json","view_paper":"https://pith.science/paper/D5OLGHMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07754&json=true","fetch_graph":"https://pith.science/api/pith-number/D5OLGHMR6CD4UXJX6OP74NTSJH/graph.json","fetch_events":"https://pith.science/api/pith-number/D5OLGHMR6CD4UXJX6OP74NTSJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH/action/storage_attestation","attest_author":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH/action/author_attestation","sign_citation":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH/action/citation_signature","submit_replication":"https://pith.science/pith/D5OLGHMR6CD4UXJX6OP74NTSJH/action/replication_record"}},"created_at":"2026-05-18T02:27:43.822523+00:00","updated_at":"2026-05-18T02:27:43.822523+00:00"}