{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:F3TFHANVJK53OGFIUGHEPLW7UU","short_pith_number":"pith:F3TFHANV","schema_version":"1.0","canonical_sha256":"2ee65381b54abbb718a8a18e47aedfa51ccf29508e585ebf5516ee0f046242ab","source":{"kind":"arxiv","id":"1511.04996","version":1},"attestation_state":"computed","paper":{"title":"Two Hops or More: On Hop-Limited Search in Opportunistic Networks","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Esa Hyyti\\\"a, J\\\"org Ott, Jussi Kangasharju, Suzan Bayhan","submitted_at":"2015-11-16T15:42:41Z","abstract_excerpt":"While there is a drastic shift from host-centric networking to content-centric networking, how to locate and retrieve the relevant content efficiently, especially in a mobile network, is still an open question. Mobile devices host increasing volume of data which could be shared with the nearby nodes in a multi-hop fashion. However, searching for content in this resource-restricted setting is not trivial due to the lack of a content index, as well as, desire for keeping the search cost low. In this paper, we analyze a lightweight search scheme, hop-limited search, that forwards the search messa"},"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":"1511.04996","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.NI","submitted_at":"2015-11-16T15:42:41Z","cross_cats_sorted":[],"title_canon_sha256":"3284e5fe51b4c70fee87f16ad81f36dd1aee7b02c142c3e052235deeb90671de","abstract_canon_sha256":"72dac946b511f83b70c20747fcd9c47ad6f48cc721e5c7e9bd23778fae7e0f1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:51.064918Z","signature_b64":"zSIDEI4W1oIrN9gA6ljoA2KJnPCuMt3moPlwXSawV0zvj0zamcHSkABDa0xjqFQZ3G15BUjqUwCx6vITrdVqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ee65381b54abbb718a8a18e47aedfa51ccf29508e585ebf5516ee0f046242ab","last_reissued_at":"2026-05-18T01:26:51.064159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:51.064159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two Hops or More: On Hop-Limited Search in Opportunistic Networks","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Esa Hyyti\\\"a, J\\\"org Ott, Jussi Kangasharju, Suzan Bayhan","submitted_at":"2015-11-16T15:42:41Z","abstract_excerpt":"While there is a drastic shift from host-centric networking to content-centric networking, how to locate and retrieve the relevant content efficiently, especially in a mobile network, is still an open question. Mobile devices host increasing volume of data which could be shared with the nearby nodes in a multi-hop fashion. However, searching for content in this resource-restricted setting is not trivial due to the lack of a content index, as well as, desire for keeping the search cost low. In this paper, we analyze a lightweight search scheme, hop-limited search, that forwards the search messa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04996","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.04996","created_at":"2026-05-18T01:26:51.064271+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04996v1","created_at":"2026-05-18T01:26:51.064271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04996","created_at":"2026-05-18T01:26:51.064271+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3TFHANVJK53","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3TFHANVJK53OGFI","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3TFHANV","created_at":"2026-05-18T12:29:19.899920+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/F3TFHANVJK53OGFIUGHEPLW7UU","json":"https://pith.science/pith/F3TFHANVJK53OGFIUGHEPLW7UU.json","graph_json":"https://pith.science/api/pith-number/F3TFHANVJK53OGFIUGHEPLW7UU/graph.json","events_json":"https://pith.science/api/pith-number/F3TFHANVJK53OGFIUGHEPLW7UU/events.json","paper":"https://pith.science/paper/F3TFHANV"},"agent_actions":{"view_html":"https://pith.science/pith/F3TFHANVJK53OGFIUGHEPLW7UU","download_json":"https://pith.science/pith/F3TFHANVJK53OGFIUGHEPLW7UU.json","view_paper":"https://pith.science/paper/F3TFHANV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04996&json=true","fetch_graph":"https://pith.science/api/pith-number/F3TFHANVJK53OGFIUGHEPLW7UU/graph.json","fetch_events":"https://pith.science/api/pith-number/F3TFHANVJK53OGFIUGHEPLW7UU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3TFHANVJK53OGFIUGHEPLW7UU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3TFHANVJK53OGFIUGHEPLW7UU/action/storage_attestation","attest_author":"https://pith.science/pith/F3TFHANVJK53OGFIUGHEPLW7UU/action/author_attestation","sign_citation":"https://pith.science/pith/F3TFHANVJK53OGFIUGHEPLW7UU/action/citation_signature","submit_replication":"https://pith.science/pith/F3TFHANVJK53OGFIUGHEPLW7UU/action/replication_record"}},"created_at":"2026-05-18T01:26:51.064271+00:00","updated_at":"2026-05-18T01:26:51.064271+00:00"}