{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ELTGDFTD5ERUNJBQVM2URVMM7H","short_pith_number":"pith:ELTGDFTD","canonical_record":{"source":{"id":"2203.00213","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-03-01T03:44:26Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"7adfffc79dde5a467244d8afc271fed2e08255ae7753ffbf965f92f56a200320","abstract_canon_sha256":"53814bc292b00eabc06a075775dd68117a5ba912f0087ee1eee8506da4305fb5"},"schema_version":"1.0"},"canonical_sha256":"22e6619663e92346a430ab3548d58cf9c24ab831df5f286f07fad18041efe3e2","source":{"kind":"arxiv","id":"2203.00213","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.00213","created_at":"2026-07-05T04:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"2203.00213v3","created_at":"2026-07-05T04:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00213","created_at":"2026-07-05T04:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"ELTGDFTD5ERU","created_at":"2026-07-05T04:24:38Z"},{"alias_kind":"pith_short_16","alias_value":"ELTGDFTD5ERUNJBQ","created_at":"2026-07-05T04:24:38Z"},{"alias_kind":"pith_short_8","alias_value":"ELTGDFTD","created_at":"2026-07-05T04:24:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ELTGDFTD5ERUNJBQVM2URVMM7H","target":"record","payload":{"canonical_record":{"source":{"id":"2203.00213","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-03-01T03:44:26Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"7adfffc79dde5a467244d8afc271fed2e08255ae7753ffbf965f92f56a200320","abstract_canon_sha256":"53814bc292b00eabc06a075775dd68117a5ba912f0087ee1eee8506da4305fb5"},"schema_version":"1.0"},"canonical_sha256":"22e6619663e92346a430ab3548d58cf9c24ab831df5f286f07fad18041efe3e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:24:38.934611Z","signature_b64":"v5JFwbqj9rNXm0ceM2cgeE3D/16MAX6+wcmLmEThh9rTZhhClt6OFHD63V7SpVFpWwGo6B8RnJtuppjbj+fRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22e6619663e92346a430ab3548d58cf9c24ab831df5f286f07fad18041efe3e2","last_reissued_at":"2026-07-05T04:24:38.934159Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:24:38.934159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.00213","source_version":3,"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-07-05T04:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ODWjMaYThOwN4t0lZSbiB73W6S707cOtmMfFogXVqchMLmMOZmWP636Xa4a2TK2xlu3wELxyDqVtghL3ieZOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T21:20:17.160622Z"},"content_sha256":"fa08cbc02d60d795d7afb117a8fcaa728afb8415b19ed5d28266071de3722fc6","schema_version":"1.0","event_id":"sha256:fa08cbc02d60d795d7afb117a8fcaa728afb8415b19ed5d28266071de3722fc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ELTGDFTD5ERUNJBQVM2URVMM7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Routing for Multi-user Multi-hop Relay Networks via Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Jamie Evans, Rajitha Senanayake, Shalanika Dayarathna","submitted_at":"2022-03-01T03:44:26Z","abstract_excerpt":"In this paper, we study the relay selection problem in multi-user, multi-hop relay networks with the objective of minimizing the maximum outage probability across all users. When only one user is present, it is well known that the optimal relay selection problem can be solved efficiently via dynamic programming. This solution breaks down in the multi-user scenario due to dependence between users. We resolve this challenge using a novel relay aggregation approach. On the expanded trellis, dynamic programming can be used to solve the optimal relay selection problem with computational complexity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00213","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.00213/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXWPW36SxuoyX/TXWZKUnCsVH1gu3AKzIA8Q3sW28Yk+e2BM1dvtWeDCWl+vbvY6hPvZI29HyTlBlk9E1KGyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T21:20:17.161051Z"},"content_sha256":"9ca66e3175a74d54c0e1f7283f71db5a62282a143e404574dba24942db320f60","schema_version":"1.0","event_id":"sha256:9ca66e3175a74d54c0e1f7283f71db5a62282a143e404574dba24942db320f60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ELTGDFTD5ERUNJBQVM2URVMM7H/bundle.json","state_url":"https://pith.science/pith/ELTGDFTD5ERUNJBQVM2URVMM7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ELTGDFTD5ERUNJBQVM2URVMM7H/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-07-10T21:20:17Z","links":{"resolver":"https://pith.science/pith/ELTGDFTD5ERUNJBQVM2URVMM7H","bundle":"https://pith.science/pith/ELTGDFTD5ERUNJBQVM2URVMM7H/bundle.json","state":"https://pith.science/pith/ELTGDFTD5ERUNJBQVM2URVMM7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ELTGDFTD5ERUNJBQVM2URVMM7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ELTGDFTD5ERUNJBQVM2URVMM7H","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":"53814bc292b00eabc06a075775dd68117a5ba912f0087ee1eee8506da4305fb5","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-03-01T03:44:26Z","title_canon_sha256":"7adfffc79dde5a467244d8afc271fed2e08255ae7753ffbf965f92f56a200320"},"schema_version":"1.0","source":{"id":"2203.00213","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.00213","created_at":"2026-07-05T04:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"2203.00213v3","created_at":"2026-07-05T04:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00213","created_at":"2026-07-05T04:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"ELTGDFTD5ERU","created_at":"2026-07-05T04:24:38Z"},{"alias_kind":"pith_short_16","alias_value":"ELTGDFTD5ERUNJBQ","created_at":"2026-07-05T04:24:38Z"},{"alias_kind":"pith_short_8","alias_value":"ELTGDFTD","created_at":"2026-07-05T04:24:38Z"}],"graph_snapshots":[{"event_id":"sha256:9ca66e3175a74d54c0e1f7283f71db5a62282a143e404574dba24942db320f60","target":"graph","created_at":"2026-07-05T04:24:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.00213/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the relay selection problem in multi-user, multi-hop relay networks with the objective of minimizing the maximum outage probability across all users. When only one user is present, it is well known that the optimal relay selection problem can be solved efficiently via dynamic programming. This solution breaks down in the multi-user scenario due to dependence between users. We resolve this challenge using a novel relay aggregation approach. On the expanded trellis, dynamic programming can be used to solve the optimal relay selection problem with computational complexity ","authors_text":"Jamie Evans, Rajitha Senanayake, Shalanika Dayarathna","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-03-01T03:44:26Z","title":"Optimal Routing for Multi-user Multi-hop Relay Networks via Dynamic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00213","kind":"arxiv","version":3},"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:fa08cbc02d60d795d7afb117a8fcaa728afb8415b19ed5d28266071de3722fc6","target":"record","created_at":"2026-07-05T04:24:38Z","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":"53814bc292b00eabc06a075775dd68117a5ba912f0087ee1eee8506da4305fb5","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-03-01T03:44:26Z","title_canon_sha256":"7adfffc79dde5a467244d8afc271fed2e08255ae7753ffbf965f92f56a200320"},"schema_version":"1.0","source":{"id":"2203.00213","kind":"arxiv","version":3}},"canonical_sha256":"22e6619663e92346a430ab3548d58cf9c24ab831df5f286f07fad18041efe3e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22e6619663e92346a430ab3548d58cf9c24ab831df5f286f07fad18041efe3e2","first_computed_at":"2026-07-05T04:24:38.934159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:24:38.934159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v5JFwbqj9rNXm0ceM2cgeE3D/16MAX6+wcmLmEThh9rTZhhClt6OFHD63V7SpVFpWwGo6B8RnJtuppjbj+fRCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:24:38.934611Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.00213","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa08cbc02d60d795d7afb117a8fcaa728afb8415b19ed5d28266071de3722fc6","sha256:9ca66e3175a74d54c0e1f7283f71db5a62282a143e404574dba24942db320f60"],"state_sha256":"695b0152059b1d570df2dec0d1ce3593042ed6bcd0242c6aaba963046a2f9d26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9PPX6X8sVeKQuaDJY+yE/6mx8MNXVIRvLi7sYVieZP79v65061CMKh/yBzCVuaD8e4DFd0sXfo1YUtE4Z6AZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T21:20:17.163587Z","bundle_sha256":"0aad40ecf8c89757a9a714462909ad3f15fd06f76c9bb47a80d68e16b8c76226"}}