{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5CR4P24BWVAFYS72VVKMUZZ35B","short_pith_number":"pith:5CR4P24B","canonical_record":{"source":{"id":"1803.01545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-05T08:10:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c7a77c8237c0ee2c2b20b32046501518cbf04b9ab31043263b03e46e3b96e0be","abstract_canon_sha256":"4a94ab639a261b290f36899251d70ac0232f54b60c9ed500fa65190ecfa19999"},"schema_version":"1.0"},"canonical_sha256":"e8a3c7eb81b5405c4bfaad54ca673be86df4cdd55f5809d46222c697bef731d7","source":{"kind":"arxiv","id":"1803.01545","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01545","created_at":"2026-05-18T00:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01545v1","created_at":"2026-05-18T00:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01545","created_at":"2026-05-18T00:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"5CR4P24BWVAF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5CR4P24BWVAFYS72","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5CR4P24B","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5CR4P24BWVAFYS72VVKMUZZ35B","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-05T08:10:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c7a77c8237c0ee2c2b20b32046501518cbf04b9ab31043263b03e46e3b96e0be","abstract_canon_sha256":"4a94ab639a261b290f36899251d70ac0232f54b60c9ed500fa65190ecfa19999"},"schema_version":"1.0"},"canonical_sha256":"e8a3c7eb81b5405c4bfaad54ca673be86df4cdd55f5809d46222c697bef731d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:00.312157Z","signature_b64":"pR4SMI/bYO7+RJBa3tZlbMIqQr3HgHk+EI9KEtTmn6vUFyiN+chNbqb/oEGcCrG2OwbhZGFs/RtlWoNY0pdGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8a3c7eb81b5405c4bfaad54ca673be86df4cdd55f5809d46222c697bef731d7","last_reissued_at":"2026-05-18T00:22:00.311501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:00.311501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01545","source_version":1,"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-18T00:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQKsiE0vHhCI09uwxZeGkXbWdYL3NhEETG1SpsEOESs+Y0vfHTha09PlB5YiQmri69wy+f1EcbYkM6mguBnZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:04:11.011351Z"},"content_sha256":"c08abd7eaad9a8d58f27bad98b9e4cae704b8f588a376f9ea1e64273b9339568","schema_version":"1.0","event_id":"sha256:c08abd7eaad9a8d58f27bad98b9e4cae704b8f588a376f9ea1e64273b9339568"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5CR4P24BWVAFYS72VVKMUZZ35B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal and Suboptimal Routing Based on Partial CSI in Random Ad-hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Itsik Bergel, Yiftach Richter","submitted_at":"2018-03-05T08:10:53Z","abstract_excerpt":"In this paper we consider routing in random wireless-adhoc-networks (WANETs), where each node is equipped with a single antenna. Our analysis uses a proper model of the physical layer together with an abstraction of higher communication layers. We assume that the nodes are distributed according to a Poisson-point-process and consider routing schemes that select the next relay based on the geographical locations, the channel gains of its neighbor nodes and the statistical characterization of all other nodes. While many routing problems are formulated as optimization problems, the optimal distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01545","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"},"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-18T00:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2HEbakyUkLLktuj4ytZ36AwnRdt02BscCHBSssWoQbPMZUw/yE3wUeYk6/DMDsUBVBvTlH/Pf1u3clW61acCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:04:11.011730Z"},"content_sha256":"77fda80c2b4a6e33deb9719e882c11b74481ccad88d159b4ebd5946f68d4f53d","schema_version":"1.0","event_id":"sha256:77fda80c2b4a6e33deb9719e882c11b74481ccad88d159b4ebd5946f68d4f53d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CR4P24BWVAFYS72VVKMUZZ35B/bundle.json","state_url":"https://pith.science/pith/5CR4P24BWVAFYS72VVKMUZZ35B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CR4P24BWVAFYS72VVKMUZZ35B/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-07T07:04:11Z","links":{"resolver":"https://pith.science/pith/5CR4P24BWVAFYS72VVKMUZZ35B","bundle":"https://pith.science/pith/5CR4P24BWVAFYS72VVKMUZZ35B/bundle.json","state":"https://pith.science/pith/5CR4P24BWVAFYS72VVKMUZZ35B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CR4P24BWVAFYS72VVKMUZZ35B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5CR4P24BWVAFYS72VVKMUZZ35B","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":"4a94ab639a261b290f36899251d70ac0232f54b60c9ed500fa65190ecfa19999","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-05T08:10:53Z","title_canon_sha256":"c7a77c8237c0ee2c2b20b32046501518cbf04b9ab31043263b03e46e3b96e0be"},"schema_version":"1.0","source":{"id":"1803.01545","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01545","created_at":"2026-05-18T00:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01545v1","created_at":"2026-05-18T00:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01545","created_at":"2026-05-18T00:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"5CR4P24BWVAF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5CR4P24BWVAFYS72","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5CR4P24B","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:77fda80c2b4a6e33deb9719e882c11b74481ccad88d159b4ebd5946f68d4f53d","target":"graph","created_at":"2026-05-18T00:22:00Z","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":"In this paper we consider routing in random wireless-adhoc-networks (WANETs), where each node is equipped with a single antenna. Our analysis uses a proper model of the physical layer together with an abstraction of higher communication layers. We assume that the nodes are distributed according to a Poisson-point-process and consider routing schemes that select the next relay based on the geographical locations, the channel gains of its neighbor nodes and the statistical characterization of all other nodes. While many routing problems are formulated as optimization problems, the optimal distri","authors_text":"Itsik Bergel, Yiftach Richter","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-05T08:10:53Z","title":"Optimal and Suboptimal Routing Based on Partial CSI in Random Ad-hoc Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01545","kind":"arxiv","version":1},"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:c08abd7eaad9a8d58f27bad98b9e4cae704b8f588a376f9ea1e64273b9339568","target":"record","created_at":"2026-05-18T00:22:00Z","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":"4a94ab639a261b290f36899251d70ac0232f54b60c9ed500fa65190ecfa19999","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-05T08:10:53Z","title_canon_sha256":"c7a77c8237c0ee2c2b20b32046501518cbf04b9ab31043263b03e46e3b96e0be"},"schema_version":"1.0","source":{"id":"1803.01545","kind":"arxiv","version":1}},"canonical_sha256":"e8a3c7eb81b5405c4bfaad54ca673be86df4cdd55f5809d46222c697bef731d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8a3c7eb81b5405c4bfaad54ca673be86df4cdd55f5809d46222c697bef731d7","first_computed_at":"2026-05-18T00:22:00.311501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:00.311501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pR4SMI/bYO7+RJBa3tZlbMIqQr3HgHk+EI9KEtTmn6vUFyiN+chNbqb/oEGcCrG2OwbhZGFs/RtlWoNY0pdGCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:00.312157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01545","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c08abd7eaad9a8d58f27bad98b9e4cae704b8f588a376f9ea1e64273b9339568","sha256:77fda80c2b4a6e33deb9719e882c11b74481ccad88d159b4ebd5946f68d4f53d"],"state_sha256":"4eb4992b42cd3bdba0049580c62c55e6cb2fc944194e1e2eda666b87ea9c2b9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C+jRpTXAZt8FRb5LmGILYYKyCtOaL79opMorJtkYTrpxhqae7rz+4zn5H/1yPn3rZqrjfm2svd1GMiVKFI2+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:04:11.014885Z","bundle_sha256":"9055292bb90d9d3f9b4e1d09202420c640303a96b97e9225c0914a5158bb8abc"}}