{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TXDJ6AIKFYZUBLXDJV5X24DXTS","short_pith_number":"pith:TXDJ6AIK","canonical_record":{"source":{"id":"1406.7572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-30T00:33:02Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"2b1e84909497f75ff5ad6ca300329660579a1791744d1c99840ac5f4618bb52b","abstract_canon_sha256":"e51527ae4c28afdf65423a733ff0a4286657f1cc5b357e96f38e7dceeb442799"},"schema_version":"1.0"},"canonical_sha256":"9dc69f010a2e3340aee34d7b7d70779c9e1860c3e617834e52f4cbd3b6f4aea3","source":{"kind":"arxiv","id":"1406.7572","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7572","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7572v1","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7572","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"TXDJ6AIKFYZU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TXDJ6AIKFYZUBLXD","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TXDJ6AIK","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TXDJ6AIKFYZUBLXDJV5X24DXTS","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-30T00:33:02Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"2b1e84909497f75ff5ad6ca300329660579a1791744d1c99840ac5f4618bb52b","abstract_canon_sha256":"e51527ae4c28afdf65423a733ff0a4286657f1cc5b357e96f38e7dceeb442799"},"schema_version":"1.0"},"canonical_sha256":"9dc69f010a2e3340aee34d7b7d70779c9e1860c3e617834e52f4cbd3b6f4aea3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:44.801327Z","signature_b64":"gMj+ELluhAxxFceLIJKBXTqnxkjKHOO0X8us09Wra21I6SSIcf0WnLCX+gJPyObBlKiOfV8BfgyFZxR0S+ZfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dc69f010a2e3340aee34d7b7d70779c9e1860c3e617834e52f4cbd3b6f4aea3","last_reissued_at":"2026-05-18T02:48:44.800780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:44.800780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7572","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-18T02:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ESVzd9NS0QZw0rD2CcocEqFPQaNMRFJidw+S4DtrYKulzstwhS3km6bUjWT9mxKr6uAZ/mkJrRL4343Ep+oPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:55:21.415704Z"},"content_sha256":"e8f1059d44e75bae7e7534fe33e3d910f3b383b1eb5d4b00c758ef173e3d1542","schema_version":"1.0","event_id":"sha256:e8f1059d44e75bae7e7534fe33e3d910f3b383b1eb5d4b00c758ef173e3d1542"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TXDJ6AIKFYZUBLXDJV5X24DXTS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Analysis of Ad-Hoc Routing in Clustered Multi-hop Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Azari, Farshad Lahouti, Jalil Seifali Harsini","submitted_at":"2014-06-30T00:33:02Z","abstract_excerpt":"This paper analyzes the performance of clustered decode-and-forward multi-hop relaying (CDFMR) wireless Rayleigh fading networks, and sheds light on their design principles for energy and spectral efficiency. The focus is on a general performance analysis (over all SNR range) of heterogeneous wireless networks with possibly different numbers of relays in clusters of various separations. For clustered multi-hop relaying systems, ad-hoc routing is known as an efficient decentralized routing algorithm which selects the best relay node on a hop-by-hop basis using local channel state information. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7572","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-18T02:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LUWLRyjlrp3ZCw6uEy9X0HvDud7swY+4C/rmYi6dkNwEOps8ptFw+0uE+a9hvtEUp+1HFFN/4QDeYvYkXgnSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:55:21.416308Z"},"content_sha256":"ddfd392816fd02f5bf52bd8f0ed73c30fa43dd5936cf303c341ec1ece36322bb","schema_version":"1.0","event_id":"sha256:ddfd392816fd02f5bf52bd8f0ed73c30fa43dd5936cf303c341ec1ece36322bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXDJ6AIKFYZUBLXDJV5X24DXTS/bundle.json","state_url":"https://pith.science/pith/TXDJ6AIKFYZUBLXDJV5X24DXTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXDJ6AIKFYZUBLXDJV5X24DXTS/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-05T17:55:21Z","links":{"resolver":"https://pith.science/pith/TXDJ6AIKFYZUBLXDJV5X24DXTS","bundle":"https://pith.science/pith/TXDJ6AIKFYZUBLXDJV5X24DXTS/bundle.json","state":"https://pith.science/pith/TXDJ6AIKFYZUBLXDJV5X24DXTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXDJ6AIKFYZUBLXDJV5X24DXTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TXDJ6AIKFYZUBLXDJV5X24DXTS","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":"e51527ae4c28afdf65423a733ff0a4286657f1cc5b357e96f38e7dceeb442799","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-30T00:33:02Z","title_canon_sha256":"2b1e84909497f75ff5ad6ca300329660579a1791744d1c99840ac5f4618bb52b"},"schema_version":"1.0","source":{"id":"1406.7572","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7572","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7572v1","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7572","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"TXDJ6AIKFYZU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TXDJ6AIKFYZUBLXD","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TXDJ6AIK","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:ddfd392816fd02f5bf52bd8f0ed73c30fa43dd5936cf303c341ec1ece36322bb","target":"graph","created_at":"2026-05-18T02:48:44Z","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":"This paper analyzes the performance of clustered decode-and-forward multi-hop relaying (CDFMR) wireless Rayleigh fading networks, and sheds light on their design principles for energy and spectral efficiency. The focus is on a general performance analysis (over all SNR range) of heterogeneous wireless networks with possibly different numbers of relays in clusters of various separations. For clustered multi-hop relaying systems, ad-hoc routing is known as an efficient decentralized routing algorithm which selects the best relay node on a hop-by-hop basis using local channel state information. I","authors_text":"Amin Azari, Farshad Lahouti, Jalil Seifali Harsini","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-30T00:33:02Z","title":"Performance Analysis of Ad-Hoc Routing in Clustered Multi-hop Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7572","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:e8f1059d44e75bae7e7534fe33e3d910f3b383b1eb5d4b00c758ef173e3d1542","target":"record","created_at":"2026-05-18T02:48:44Z","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":"e51527ae4c28afdf65423a733ff0a4286657f1cc5b357e96f38e7dceeb442799","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-30T00:33:02Z","title_canon_sha256":"2b1e84909497f75ff5ad6ca300329660579a1791744d1c99840ac5f4618bb52b"},"schema_version":"1.0","source":{"id":"1406.7572","kind":"arxiv","version":1}},"canonical_sha256":"9dc69f010a2e3340aee34d7b7d70779c9e1860c3e617834e52f4cbd3b6f4aea3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dc69f010a2e3340aee34d7b7d70779c9e1860c3e617834e52f4cbd3b6f4aea3","first_computed_at":"2026-05-18T02:48:44.800780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:44.800780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gMj+ELluhAxxFceLIJKBXTqnxkjKHOO0X8us09Wra21I6SSIcf0WnLCX+gJPyObBlKiOfV8BfgyFZxR0S+ZfCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:44.801327Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7572","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8f1059d44e75bae7e7534fe33e3d910f3b383b1eb5d4b00c758ef173e3d1542","sha256:ddfd392816fd02f5bf52bd8f0ed73c30fa43dd5936cf303c341ec1ece36322bb"],"state_sha256":"7f752af17c3a006f073068e579baa5aa23db18dd0c0fd7c32cbbbc8acfd86952"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MV6dzdNd4WZLZY89NhXuNzjUPeDak1F94+di2IAoNXBFgrrxUEs/esfSAKXZHge3sxXHT1QsgBb0TcEGaRqGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:55:21.419286Z","bundle_sha256":"be814eec9f74dba66f704c66fe3d9ef2a3bba9f63c4da99a0279fde80eb16cb2"}}