{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:EN33KIIDYOB7VLRLACSSAGGJQ6","short_pith_number":"pith:EN33KIID","schema_version":"1.0","canonical_sha256":"2377b52103c383faae2b00a52018c987be607e4a4766842f04853ea74f4ac3a7","source":{"kind":"arxiv","id":"0901.3257","version":2},"attestation_state":"computed","paper":{"title":"On Leveraging Partial Paths in Partially-Connected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hanoch Levy, Merkouris Karaliopoulos, Simon Heimlicher, Thrasyvoulos Spyropoulos","submitted_at":"2009-01-21T14:47:45Z","abstract_excerpt":"Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either close to unity, assuming connected paths between all nodes (mobile ad hoc networks), or it is close to zero, assuming no multi-hop paths exist at all (delay-tolerant networks). In this paper, we argue that a sizable fraction of networks lies between these extremes and is characterized by the existence of partial paths, i.e. multi-hop path segments that allow forwarding data closer to the destination even when no end-to-end path"},"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":"0901.3257","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-01-21T14:47:45Z","cross_cats_sorted":[],"title_canon_sha256":"5f80ba2b8d46b99dcfbe665713fbb1b921b100f05a92f953b74140ce7d492312","abstract_canon_sha256":"e3b98d3fe6e59128fb2a9ffc8b956461512be5453d5ed7dd954bbfa969a9fd65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.499344Z","signature_b64":"oE9Eg8e4OmutOPenrvaRIKaN1Z0VSovoVwvP3uW+uKh5Nr629/Twym1U4GyDIww94S6K+ci1IocPnVEWGXKWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2377b52103c383faae2b00a52018c987be607e4a4766842f04853ea74f4ac3a7","last_reissued_at":"2026-05-18T00:59:11.498628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.498628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Leveraging Partial Paths in Partially-Connected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hanoch Levy, Merkouris Karaliopoulos, Simon Heimlicher, Thrasyvoulos Spyropoulos","submitted_at":"2009-01-21T14:47:45Z","abstract_excerpt":"Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either close to unity, assuming connected paths between all nodes (mobile ad hoc networks), or it is close to zero, assuming no multi-hop paths exist at all (delay-tolerant networks). In this paper, we argue that a sizable fraction of networks lies between these extremes and is characterized by the existence of partial paths, i.e. multi-hop path segments that allow forwarding data closer to the destination even when no end-to-end path"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.3257","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":"0901.3257","created_at":"2026-05-18T00:59:11.498745+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.3257v2","created_at":"2026-05-18T00:59:11.498745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.3257","created_at":"2026-05-18T00:59:11.498745+00:00"},{"alias_kind":"pith_short_12","alias_value":"EN33KIIDYOB7","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"EN33KIIDYOB7VLRL","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"EN33KIID","created_at":"2026-05-18T12:25:59.703012+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/EN33KIIDYOB7VLRLACSSAGGJQ6","json":"https://pith.science/pith/EN33KIIDYOB7VLRLACSSAGGJQ6.json","graph_json":"https://pith.science/api/pith-number/EN33KIIDYOB7VLRLACSSAGGJQ6/graph.json","events_json":"https://pith.science/api/pith-number/EN33KIIDYOB7VLRLACSSAGGJQ6/events.json","paper":"https://pith.science/paper/EN33KIID"},"agent_actions":{"view_html":"https://pith.science/pith/EN33KIIDYOB7VLRLACSSAGGJQ6","download_json":"https://pith.science/pith/EN33KIIDYOB7VLRLACSSAGGJQ6.json","view_paper":"https://pith.science/paper/EN33KIID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.3257&json=true","fetch_graph":"https://pith.science/api/pith-number/EN33KIIDYOB7VLRLACSSAGGJQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/EN33KIIDYOB7VLRLACSSAGGJQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EN33KIIDYOB7VLRLACSSAGGJQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EN33KIIDYOB7VLRLACSSAGGJQ6/action/storage_attestation","attest_author":"https://pith.science/pith/EN33KIIDYOB7VLRLACSSAGGJQ6/action/author_attestation","sign_citation":"https://pith.science/pith/EN33KIIDYOB7VLRLACSSAGGJQ6/action/citation_signature","submit_replication":"https://pith.science/pith/EN33KIIDYOB7VLRLACSSAGGJQ6/action/replication_record"}},"created_at":"2026-05-18T00:59:11.498745+00:00","updated_at":"2026-05-18T00:59:11.498745+00:00"}