{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SZQDOPUKOPGGWKMEFARFH5KHK5","short_pith_number":"pith:SZQDOPUK","canonical_record":{"source":{"id":"1710.11420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-31T12:04:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"70d0623df228234ab71c74569bb671ed84dfcc4b2a70782a1df1d0abd0dd2497","abstract_canon_sha256":"0336b73177b194d3dd58ea01dc9d31c941720f0fca84e4e6556857e6454a49ea"},"schema_version":"1.0"},"canonical_sha256":"9660373e8a73cc6b2984282253f547576cf351649c61ce8c795ec835b98b97b9","source":{"kind":"arxiv","id":"1710.11420","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11420","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11420v1","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11420","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"pith_short_12","alias_value":"SZQDOPUKOPGG","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SZQDOPUKOPGGWKME","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SZQDOPUK","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SZQDOPUKOPGGWKMEFARFH5KHK5","target":"record","payload":{"canonical_record":{"source":{"id":"1710.11420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-31T12:04:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"70d0623df228234ab71c74569bb671ed84dfcc4b2a70782a1df1d0abd0dd2497","abstract_canon_sha256":"0336b73177b194d3dd58ea01dc9d31c941720f0fca84e4e6556857e6454a49ea"},"schema_version":"1.0"},"canonical_sha256":"9660373e8a73cc6b2984282253f547576cf351649c61ce8c795ec835b98b97b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:37.465367Z","signature_b64":"cTGa+5CqMQyvrTm/4j7agJvRuswEp1o/lXuvYBhV53bVn91pKDT8LSWOJ2o50jsWYs0PjsqfVX6OknRrpn4DAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9660373e8a73cc6b2984282253f547576cf351649c61ce8c795ec835b98b97b9","last_reissued_at":"2026-05-18T00:31:37.464705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:37.464705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.11420","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:31:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OrdKa76bnNuZISdb1tJuR657x9XkQNHWOkBeFjFHMOQF0ghDjf0bMcVug972R4fB6jbzITBaQNvQEOOcA4uaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:06:59.878374Z"},"content_sha256":"4676cbeaf11a8fdbced8f757b22b7832eb2efe71a2b1424e33bf38f863c77a63","schema_version":"1.0","event_id":"sha256:4676cbeaf11a8fdbced8f757b22b7832eb2efe71a2b1424e33bf38f863c77a63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SZQDOPUKOPGGWKMEFARFH5KHK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Cooperative Computation and Interactive Communication for Relay-Assisted Mobile Edge Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingjie Zhao, Minjian Zhao, Qingjiang Shi, Xihan Chen, Yunlong Cai","submitted_at":"2017-10-31T12:04:00Z","abstract_excerpt":"To realize cooperative computation and communication in a relay mobile edge computing system, we develop a hybrid relay forward protocol, where we seek to balance the execution delay and network energy consumption. The problem is formulated as a nondifferentible optimization problem which is nonconvex with highly coupled constraints. By exploiting the problem structure, we propose a lightweight algorithm based on inexact block coordinate descent method. Our results show that the proposed algorithm exhibits much faster convergence as compared with the popular concave-convex procedure based algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11420","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:31:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U7KLSl02gYE7J2MgTSrBXDRQ36Mywf0AFMjM0/4cFuyH2B0lVuWPqPdRDt7wG+JdR7aMFfp7GgMw5sf1r3APCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:06:59.879057Z"},"content_sha256":"37192a347202eb2dfdc2ebef95ebdebda2e5673b066573f2aa9f2ffdb66810ba","schema_version":"1.0","event_id":"sha256:37192a347202eb2dfdc2ebef95ebdebda2e5673b066573f2aa9f2ffdb66810ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZQDOPUKOPGGWKMEFARFH5KHK5/bundle.json","state_url":"https://pith.science/pith/SZQDOPUKOPGGWKMEFARFH5KHK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZQDOPUKOPGGWKMEFARFH5KHK5/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-05-27T08:06:59Z","links":{"resolver":"https://pith.science/pith/SZQDOPUKOPGGWKMEFARFH5KHK5","bundle":"https://pith.science/pith/SZQDOPUKOPGGWKMEFARFH5KHK5/bundle.json","state":"https://pith.science/pith/SZQDOPUKOPGGWKMEFARFH5KHK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZQDOPUKOPGGWKMEFARFH5KHK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SZQDOPUKOPGGWKMEFARFH5KHK5","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":"0336b73177b194d3dd58ea01dc9d31c941720f0fca84e4e6556857e6454a49ea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-31T12:04:00Z","title_canon_sha256":"70d0623df228234ab71c74569bb671ed84dfcc4b2a70782a1df1d0abd0dd2497"},"schema_version":"1.0","source":{"id":"1710.11420","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11420","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11420v1","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11420","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"pith_short_12","alias_value":"SZQDOPUKOPGG","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SZQDOPUKOPGGWKME","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SZQDOPUK","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:37192a347202eb2dfdc2ebef95ebdebda2e5673b066573f2aa9f2ffdb66810ba","target":"graph","created_at":"2026-05-18T00:31: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":"To realize cooperative computation and communication in a relay mobile edge computing system, we develop a hybrid relay forward protocol, where we seek to balance the execution delay and network energy consumption. The problem is formulated as a nondifferentible optimization problem which is nonconvex with highly coupled constraints. By exploiting the problem structure, we propose a lightweight algorithm based on inexact block coordinate descent method. Our results show that the proposed algorithm exhibits much faster convergence as compared with the popular concave-convex procedure based algo","authors_text":"Mingjie Zhao, Minjian Zhao, Qingjiang Shi, Xihan Chen, Yunlong Cai","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-31T12:04:00Z","title":"Joint Cooperative Computation and Interactive Communication for Relay-Assisted Mobile Edge Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11420","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:4676cbeaf11a8fdbced8f757b22b7832eb2efe71a2b1424e33bf38f863c77a63","target":"record","created_at":"2026-05-18T00:31: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":"0336b73177b194d3dd58ea01dc9d31c941720f0fca84e4e6556857e6454a49ea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-31T12:04:00Z","title_canon_sha256":"70d0623df228234ab71c74569bb671ed84dfcc4b2a70782a1df1d0abd0dd2497"},"schema_version":"1.0","source":{"id":"1710.11420","kind":"arxiv","version":1}},"canonical_sha256":"9660373e8a73cc6b2984282253f547576cf351649c61ce8c795ec835b98b97b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9660373e8a73cc6b2984282253f547576cf351649c61ce8c795ec835b98b97b9","first_computed_at":"2026-05-18T00:31:37.464705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:37.464705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cTGa+5CqMQyvrTm/4j7agJvRuswEp1o/lXuvYBhV53bVn91pKDT8LSWOJ2o50jsWYs0PjsqfVX6OknRrpn4DAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:37.465367Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11420","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4676cbeaf11a8fdbced8f757b22b7832eb2efe71a2b1424e33bf38f863c77a63","sha256:37192a347202eb2dfdc2ebef95ebdebda2e5673b066573f2aa9f2ffdb66810ba"],"state_sha256":"b6a70121a665436c1e854aec165ec0fae202fde5b37097fe9ebdb53bf2d3a882"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1f5nQaNa5ke0jj8tNrlCwHA7uS31ZynhbaupWXC0vD7l52VIklRyRLPLvSACU0g0vYl+viXP5LkPWc/wqbUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:06:59.882626Z","bundle_sha256":"a033cc29b9e6d656394f1e77850b3d430b364e5b43fa808f39896ef30fe5ec98"}}