{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N5EPO6ZMJPNB7HCI6YYVG6OZX6","short_pith_number":"pith:N5EPO6ZM","canonical_record":{"source":{"id":"1702.04749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-15T19:42:56Z","cross_cats_sorted":[],"title_canon_sha256":"23ac2f8326defd260a43c49eea5b0a00fe71f571561802f496ef9f913fdf8477","abstract_canon_sha256":"6e235012fd275e4813cb2ed2f01ef001294a811121b29997574e92c48b939547"},"schema_version":"1.0"},"canonical_sha256":"6f48f77b2c4bda1f9c48f6315379d9bfa9fd502adcb00b06caa0d8759adc62da","source":{"kind":"arxiv","id":"1702.04749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04749","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04749v1","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04749","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"N5EPO6ZMJPNB","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N5EPO6ZMJPNB7HCI","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N5EPO6ZM","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N5EPO6ZMJPNB7HCI6YYVG6OZX6","target":"record","payload":{"canonical_record":{"source":{"id":"1702.04749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-15T19:42:56Z","cross_cats_sorted":[],"title_canon_sha256":"23ac2f8326defd260a43c49eea5b0a00fe71f571561802f496ef9f913fdf8477","abstract_canon_sha256":"6e235012fd275e4813cb2ed2f01ef001294a811121b29997574e92c48b939547"},"schema_version":"1.0"},"canonical_sha256":"6f48f77b2c4bda1f9c48f6315379d9bfa9fd502adcb00b06caa0d8759adc62da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:37.184331Z","signature_b64":"c0iACoN+7dBfS6/X4THHKMqE9N4ZgFZpruOB7DD9aOCASbJDZufHcW8/JIvwaWkOfs995DL7CHUMnC1xvge7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f48f77b2c4bda1f9c48f6315379d9bfa9fd502adcb00b06caa0d8759adc62da","last_reissued_at":"2026-05-18T00:50:37.183794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:37.183794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.04749","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:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hiEUqj70m1fkxhY9xDP1zuP8TbGElvZCKsPZ21vE8usCjG9mzX0XoaCWuiCYmR+NNFN6wPrdGgtYsDHqTAf7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:24:03.418200Z"},"content_sha256":"e5b18d0c56e6c2abadf111fe663db647df9607aebc99f3bce03299dcf36bf245","schema_version":"1.0","event_id":"sha256:e5b18d0c56e6c2abadf111fe663db647df9607aebc99f3bce03299dcf36bf245"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N5EPO6ZMJPNB7HCI6YYVG6OZX6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Routing, Scheduling and Power Control Providing Hard Deadline in Wireless Multihop Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Satya V Kumar, Vinod Sharma","submitted_at":"2017-02-15T19:42:56Z","abstract_excerpt":"We consider optimal/efficient power allocation policies in a single/multihop wireless network in the presence of hard end-to-end deadline delay constraints on the transmitted packets. Such constraints can be useful for real time voice and video. Power is consumed in only transmission of the data. We consider the case when the power used in transmission is a convex function of the data transmitted. We develop a computationally efficient online algorithm, which minimizes the average power for the single hop. We model this problem as dynamic program (DP) and obtain the optimal solution. Next, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04749","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:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q71DE3d2haLX5CP5Ai/BE64BY58UgS5oXZHdTGFBwSACUZEDAv3LJ3+uwOg0NJCy1TXSLoIvvHehxDAdATQ6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:24:03.418563Z"},"content_sha256":"f09ba051e0e5b5eba5980c129409a6bbcc03c673ae519fd2c25fc79f8f8625b5","schema_version":"1.0","event_id":"sha256:f09ba051e0e5b5eba5980c129409a6bbcc03c673ae519fd2c25fc79f8f8625b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5EPO6ZMJPNB7HCI6YYVG6OZX6/bundle.json","state_url":"https://pith.science/pith/N5EPO6ZMJPNB7HCI6YYVG6OZX6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5EPO6ZMJPNB7HCI6YYVG6OZX6/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-23T12:24:03Z","links":{"resolver":"https://pith.science/pith/N5EPO6ZMJPNB7HCI6YYVG6OZX6","bundle":"https://pith.science/pith/N5EPO6ZMJPNB7HCI6YYVG6OZX6/bundle.json","state":"https://pith.science/pith/N5EPO6ZMJPNB7HCI6YYVG6OZX6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5EPO6ZMJPNB7HCI6YYVG6OZX6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N5EPO6ZMJPNB7HCI6YYVG6OZX6","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":"6e235012fd275e4813cb2ed2f01ef001294a811121b29997574e92c48b939547","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-15T19:42:56Z","title_canon_sha256":"23ac2f8326defd260a43c49eea5b0a00fe71f571561802f496ef9f913fdf8477"},"schema_version":"1.0","source":{"id":"1702.04749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04749","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04749v1","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04749","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"N5EPO6ZMJPNB","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N5EPO6ZMJPNB7HCI","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N5EPO6ZM","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:f09ba051e0e5b5eba5980c129409a6bbcc03c673ae519fd2c25fc79f8f8625b5","target":"graph","created_at":"2026-05-18T00:50:37Z","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":"We consider optimal/efficient power allocation policies in a single/multihop wireless network in the presence of hard end-to-end deadline delay constraints on the transmitted packets. Such constraints can be useful for real time voice and video. Power is consumed in only transmission of the data. We consider the case when the power used in transmission is a convex function of the data transmitted. We develop a computationally efficient online algorithm, which minimizes the average power for the single hop. We model this problem as dynamic program (DP) and obtain the optimal solution. Next, we ","authors_text":"Satya V Kumar, Vinod Sharma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-15T19:42:56Z","title":"Joint Routing, Scheduling and Power Control Providing Hard Deadline in Wireless Multihop Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04749","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:e5b18d0c56e6c2abadf111fe663db647df9607aebc99f3bce03299dcf36bf245","target":"record","created_at":"2026-05-18T00:50:37Z","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":"6e235012fd275e4813cb2ed2f01ef001294a811121b29997574e92c48b939547","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-15T19:42:56Z","title_canon_sha256":"23ac2f8326defd260a43c49eea5b0a00fe71f571561802f496ef9f913fdf8477"},"schema_version":"1.0","source":{"id":"1702.04749","kind":"arxiv","version":1}},"canonical_sha256":"6f48f77b2c4bda1f9c48f6315379d9bfa9fd502adcb00b06caa0d8759adc62da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f48f77b2c4bda1f9c48f6315379d9bfa9fd502adcb00b06caa0d8759adc62da","first_computed_at":"2026-05-18T00:50:37.183794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:37.183794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c0iACoN+7dBfS6/X4THHKMqE9N4ZgFZpruOB7DD9aOCASbJDZufHcW8/JIvwaWkOfs995DL7CHUMnC1xvge7Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:37.184331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5b18d0c56e6c2abadf111fe663db647df9607aebc99f3bce03299dcf36bf245","sha256:f09ba051e0e5b5eba5980c129409a6bbcc03c673ae519fd2c25fc79f8f8625b5"],"state_sha256":"36435b5c6a78c283db44697e368d2bdc91628106cd8cc4953c2d1691cba23d8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MTHeBLMHZczxYugRBiPyGNlJnh57bqAobunuXY4avURIfXalgvCwgThzs45ubaaTnJshmyfi6E5Th2Pgppg8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:24:03.420530Z","bundle_sha256":"be6de29cdc05bb0a8938fc36fb60170fdddda6cd712f368f4fd095c609365f1e"}}