{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UYHDEBE46G3JUE75GDWAWOX7WW","short_pith_number":"pith:UYHDEBE4","schema_version":"1.0","canonical_sha256":"a60e32049cf1b69a13fd30ec0b3affb597c87baaf16f3161ea8b637a560dbddc","source":{"kind":"arxiv","id":"1607.00862","version":1},"attestation_state":"computed","paper":{"title":"One- and Multi-Pass Long-Hop Routing for Wireless Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Jacek Cicho\\'n, Jakub Lemiesz, Marcin Zawada, Miros{\\l}aw Kuty{\\l}owski, Przemys{\\l}aw B{\\l}a\\'skiewicz","submitted_at":"2016-07-04T12:46:35Z","abstract_excerpt":"In our paper we provide mathematical analysis of a probabilistic long-hop routing algorithms which uses as the randomizing factor the estimate of distance of a station from the previous-hop source of the message."},"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":"1607.00862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-07-04T12:46:35Z","cross_cats_sorted":[],"title_canon_sha256":"0d1134a775aa5bf7a9891f612cdd81cba83731555ebcc77c4f81450046e442f8","abstract_canon_sha256":"a9285a90baa1d0a0f47e3a027d06ff1b107fb842f479091539ab531862803c02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:34.112510Z","signature_b64":"6av7zf12O1r/TSHUJR6wl9+tkVvZmApyaZx+7Id2WrY5woOZH5UenPtaUolBsmHidvYb5R9Bd9I3kwxNwb0aAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a60e32049cf1b69a13fd30ec0b3affb597c87baaf16f3161ea8b637a560dbddc","last_reissued_at":"2026-05-18T01:11:34.112116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:34.112116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One- and Multi-Pass Long-Hop Routing for Wireless Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Jacek Cicho\\'n, Jakub Lemiesz, Marcin Zawada, Miros{\\l}aw Kuty{\\l}owski, Przemys{\\l}aw B{\\l}a\\'skiewicz","submitted_at":"2016-07-04T12:46:35Z","abstract_excerpt":"In our paper we provide mathematical analysis of a probabilistic long-hop routing algorithms which uses as the randomizing factor the estimate of distance of a station from the previous-hop source of the message."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00862","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":"1607.00862","created_at":"2026-05-18T01:11:34.112175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00862v1","created_at":"2026-05-18T01:11:34.112175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00862","created_at":"2026-05-18T01:11:34.112175+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYHDEBE46G3J","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYHDEBE46G3JUE75","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYHDEBE4","created_at":"2026-05-18T12:30:46.583412+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/UYHDEBE46G3JUE75GDWAWOX7WW","json":"https://pith.science/pith/UYHDEBE46G3JUE75GDWAWOX7WW.json","graph_json":"https://pith.science/api/pith-number/UYHDEBE46G3JUE75GDWAWOX7WW/graph.json","events_json":"https://pith.science/api/pith-number/UYHDEBE46G3JUE75GDWAWOX7WW/events.json","paper":"https://pith.science/paper/UYHDEBE4"},"agent_actions":{"view_html":"https://pith.science/pith/UYHDEBE46G3JUE75GDWAWOX7WW","download_json":"https://pith.science/pith/UYHDEBE46G3JUE75GDWAWOX7WW.json","view_paper":"https://pith.science/paper/UYHDEBE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00862&json=true","fetch_graph":"https://pith.science/api/pith-number/UYHDEBE46G3JUE75GDWAWOX7WW/graph.json","fetch_events":"https://pith.science/api/pith-number/UYHDEBE46G3JUE75GDWAWOX7WW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYHDEBE46G3JUE75GDWAWOX7WW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYHDEBE46G3JUE75GDWAWOX7WW/action/storage_attestation","attest_author":"https://pith.science/pith/UYHDEBE46G3JUE75GDWAWOX7WW/action/author_attestation","sign_citation":"https://pith.science/pith/UYHDEBE46G3JUE75GDWAWOX7WW/action/citation_signature","submit_replication":"https://pith.science/pith/UYHDEBE46G3JUE75GDWAWOX7WW/action/replication_record"}},"created_at":"2026-05-18T01:11:34.112175+00:00","updated_at":"2026-05-18T01:11:34.112175+00:00"}