{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:O4XK6PITIK2HUJQ7YBM4ISIEHH","short_pith_number":"pith:O4XK6PIT","canonical_record":{"source":{"id":"1508.02117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-10T03:36:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b335738fb1af60c9b3238c1339df62e2ccff376b1705831768e7e8ceb8ce62b","abstract_canon_sha256":"78a0a2f8c3011e8c0591e800303b6b6823bb9ab9887ed34b8cd97360e91cec3f"},"schema_version":"1.0"},"canonical_sha256":"772eaf3d1342b47a261fc059c4490439fae76f73682b1f7bc16b089ad55c759b","source":{"kind":"arxiv","id":"1508.02117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02117","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02117v1","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02117","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"pith_short_12","alias_value":"O4XK6PITIK2H","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O4XK6PITIK2HUJQ7","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O4XK6PIT","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:O4XK6PITIK2HUJQ7YBM4ISIEHH","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-10T03:36:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b335738fb1af60c9b3238c1339df62e2ccff376b1705831768e7e8ceb8ce62b","abstract_canon_sha256":"78a0a2f8c3011e8c0591e800303b6b6823bb9ab9887ed34b8cd97360e91cec3f"},"schema_version":"1.0"},"canonical_sha256":"772eaf3d1342b47a261fc059c4490439fae76f73682b1f7bc16b089ad55c759b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:34.161848Z","signature_b64":"LMKzsfGZCOHbuf3DpUToTY3yYWJAtl78HUFSCXH5XR7tztwK+ryU7ZuAAWiH9Aj7TKqV4asRlC4Kbe2B7Ry8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"772eaf3d1342b47a261fc059c4490439fae76f73682b1f7bc16b089ad55c759b","last_reissued_at":"2026-05-18T01:35:34.160972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:34.160972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02117","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-18T01:35:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6eoVouG4bE4wdQy+2jzWL7V9wniiha226Nqr/WSV35cIJgJ9h8ZrnuiOhDW1jkccOreAl0V6MgE29bg6I6xqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:18:32.635134Z"},"content_sha256":"15f1d3d590f15a4cc52854154b25428c266c10a8945415cae9747f80de87ae38","schema_version":"1.0","event_id":"sha256:15f1d3d590f15a4cc52854154b25428c266c10a8945415cae9747f80de87ae38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:O4XK6PITIK2HUJQ7YBM4ISIEHH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Relaying for Large Random Multihop Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amogh Rajanna, Mos Kaveh","submitted_at":"2015-08-10T03:36:15Z","abstract_excerpt":"In this paper, we propose a new relaying protocol for large multihop networks combining the concepts of cooperative diversity and opportunistic relaying. The cooperative relaying protocol is based on two diversity mechanisms, incremental redundancy combining and repetition combining. We assume that nodes in the large multihop network are modeled by a homogeneous Poisson Point Process and operate under Rayleigh fading and constant power transmission per node. The performance of the proposed relaying protocol is evaluated through the progress rate density (PRD) of the multihop network and compar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02117","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-18T01:35:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9yEjgwyiz0lZRED+egVEyR/BKo0MI3n+Y2AV/D19GSLZwzI2ybiibr8sc5EimZ+Vvug4EAoUJuqZ/Qrl8/qACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:18:32.635510Z"},"content_sha256":"292421d4a6cfd5403818bfa03794b63741718fe04d120716742ffda5e8084cc8","schema_version":"1.0","event_id":"sha256:292421d4a6cfd5403818bfa03794b63741718fe04d120716742ffda5e8084cc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4XK6PITIK2HUJQ7YBM4ISIEHH/bundle.json","state_url":"https://pith.science/pith/O4XK6PITIK2HUJQ7YBM4ISIEHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4XK6PITIK2HUJQ7YBM4ISIEHH/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-02T02:18:32Z","links":{"resolver":"https://pith.science/pith/O4XK6PITIK2HUJQ7YBM4ISIEHH","bundle":"https://pith.science/pith/O4XK6PITIK2HUJQ7YBM4ISIEHH/bundle.json","state":"https://pith.science/pith/O4XK6PITIK2HUJQ7YBM4ISIEHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4XK6PITIK2HUJQ7YBM4ISIEHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:O4XK6PITIK2HUJQ7YBM4ISIEHH","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":"78a0a2f8c3011e8c0591e800303b6b6823bb9ab9887ed34b8cd97360e91cec3f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-10T03:36:15Z","title_canon_sha256":"3b335738fb1af60c9b3238c1339df62e2ccff376b1705831768e7e8ceb8ce62b"},"schema_version":"1.0","source":{"id":"1508.02117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02117","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02117v1","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02117","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"pith_short_12","alias_value":"O4XK6PITIK2H","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O4XK6PITIK2HUJQ7","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O4XK6PIT","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:292421d4a6cfd5403818bfa03794b63741718fe04d120716742ffda5e8084cc8","target":"graph","created_at":"2026-05-18T01:35:34Z","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 propose a new relaying protocol for large multihop networks combining the concepts of cooperative diversity and opportunistic relaying. The cooperative relaying protocol is based on two diversity mechanisms, incremental redundancy combining and repetition combining. We assume that nodes in the large multihop network are modeled by a homogeneous Poisson Point Process and operate under Rayleigh fading and constant power transmission per node. The performance of the proposed relaying protocol is evaluated through the progress rate density (PRD) of the multihop network and compar","authors_text":"Amogh Rajanna, Mos Kaveh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-10T03:36:15Z","title":"Cooperative Relaying for Large Random Multihop Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02117","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:15f1d3d590f15a4cc52854154b25428c266c10a8945415cae9747f80de87ae38","target":"record","created_at":"2026-05-18T01:35:34Z","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":"78a0a2f8c3011e8c0591e800303b6b6823bb9ab9887ed34b8cd97360e91cec3f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-10T03:36:15Z","title_canon_sha256":"3b335738fb1af60c9b3238c1339df62e2ccff376b1705831768e7e8ceb8ce62b"},"schema_version":"1.0","source":{"id":"1508.02117","kind":"arxiv","version":1}},"canonical_sha256":"772eaf3d1342b47a261fc059c4490439fae76f73682b1f7bc16b089ad55c759b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"772eaf3d1342b47a261fc059c4490439fae76f73682b1f7bc16b089ad55c759b","first_computed_at":"2026-05-18T01:35:34.160972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:34.160972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LMKzsfGZCOHbuf3DpUToTY3yYWJAtl78HUFSCXH5XR7tztwK+ryU7ZuAAWiH9Aj7TKqV4asRlC4Kbe2B7Ry8Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:34.161848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15f1d3d590f15a4cc52854154b25428c266c10a8945415cae9747f80de87ae38","sha256:292421d4a6cfd5403818bfa03794b63741718fe04d120716742ffda5e8084cc8"],"state_sha256":"08ab684986f6e7a1dce0cd7f7cffb2797f42bd2c1e6b95d0a6da5e9d3e511e07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/5a6fyjxNLN8kTBCwxjtC5YWTZeRH3yppDMuz/8hwW7zO8/4OLh6wBFJ4L3eEijPGDJSs8u0E3Nv6E18mgMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:18:32.637454Z","bundle_sha256":"e76478b43da271ec8b5ebdccacd105a9ad17bd15af0fa79954078b80bf92d588"}}