{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FWSWSML4IKU74SGUO4GNHGRXBJ","short_pith_number":"pith:FWSWSML4","canonical_record":{"source":{"id":"1905.13378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-31T01:54:53Z","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"title_canon_sha256":"fa0de11f837f0a1e906c6822a265c4e44fb388c564475ec8016299cd85872369","abstract_canon_sha256":"c2cc53250d6968ff1393f29ffa4f3d7d725bd0ba205662e990ac0d71ea8e382a"},"schema_version":"1.0"},"canonical_sha256":"2da569317c42a9fe48d4770cd39a370a4c2a2a74e4ace425813638c52ca15c07","source":{"kind":"arxiv","id":"1905.13378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13378","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13378v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13378","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"FWSWSML4IKU7","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FWSWSML4IKU74SGU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FWSWSML4","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FWSWSML4IKU74SGUO4GNHGRXBJ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-31T01:54:53Z","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"title_canon_sha256":"fa0de11f837f0a1e906c6822a265c4e44fb388c564475ec8016299cd85872369","abstract_canon_sha256":"c2cc53250d6968ff1393f29ffa4f3d7d725bd0ba205662e990ac0d71ea8e382a"},"schema_version":"1.0"},"canonical_sha256":"2da569317c42a9fe48d4770cd39a370a4c2a2a74e4ace425813638c52ca15c07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:35.110034Z","signature_b64":"myQCgofCoIutIxM/1hCkz8YfJYqot9TIAAP+3AB235ENKergX3+T2QKmG37Be0YHFsAk+WNlNjB8AuY3nhZBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2da569317c42a9fe48d4770cd39a370a4c2a2a74e4ace425813638c52ca15c07","last_reissued_at":"2026-05-17T23:44:35.109423Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:35.109423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13378","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-17T23:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l6UPbVSzT3rpzWxfVyeasjskG0AiGNTB1fhC+ijSYZ2HgxZkKV375bjj1hjdaViMMnDQ4vFzPMBDrrdg4UmFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:20:07.146773Z"},"content_sha256":"4cc24cfad9eb5c08a5a45c0b8175edd410d09c450540fad8739afae16081f531","schema_version":"1.0","event_id":"sha256:4cc24cfad9eb5c08a5a45c0b8175edd410d09c450540fad8739afae16081f531"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FWSWSML4IKU74SGUO4GNHGRXBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Learning for Distributed Optimization: Applications to Wireless Resource Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Hoon Lee, Sang Hyun Lee, Tony Q. S. Quek","submitted_at":"2019-05-31T01:54:53Z","abstract_excerpt":"This paper studies a deep learning (DL) framework to solve distributed non-convex constrained optimizations in wireless networks where multiple computing nodes, interconnected via backhaul links, desire to determine an efficient assignment of their states based on local observations. Two different configurations are considered: First, an infinite-capacity backhaul enables nodes to communicate in a lossless way, thereby obtaining the solution by centralized computations. Second, a practical finite-capacity backhaul leads to the deployment of distributed solvers equipped along with quantizers fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13378","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-17T23:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5iwpRwrdSgFfMdeol1nkv7cELHeV5JNqxjSXE1jREqc3BYsaLKD9ulmD1vTWdB1lBxNVu4wGI5tb16sWZhbNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:20:07.147420Z"},"content_sha256":"fc94f05a085b657ffa072353abd67bce77ad809787e3e60735f6484e13bd387f","schema_version":"1.0","event_id":"sha256:fc94f05a085b657ffa072353abd67bce77ad809787e3e60735f6484e13bd387f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FWSWSML4IKU74SGUO4GNHGRXBJ/bundle.json","state_url":"https://pith.science/pith/FWSWSML4IKU74SGUO4GNHGRXBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FWSWSML4IKU74SGUO4GNHGRXBJ/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-01T05:20:07Z","links":{"resolver":"https://pith.science/pith/FWSWSML4IKU74SGUO4GNHGRXBJ","bundle":"https://pith.science/pith/FWSWSML4IKU74SGUO4GNHGRXBJ/bundle.json","state":"https://pith.science/pith/FWSWSML4IKU74SGUO4GNHGRXBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FWSWSML4IKU74SGUO4GNHGRXBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FWSWSML4IKU74SGUO4GNHGRXBJ","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":"c2cc53250d6968ff1393f29ffa4f3d7d725bd0ba205662e990ac0d71ea8e382a","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-31T01:54:53Z","title_canon_sha256":"fa0de11f837f0a1e906c6822a265c4e44fb388c564475ec8016299cd85872369"},"schema_version":"1.0","source":{"id":"1905.13378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13378","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13378v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13378","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"FWSWSML4IKU7","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FWSWSML4IKU74SGU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FWSWSML4","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:fc94f05a085b657ffa072353abd67bce77ad809787e3e60735f6484e13bd387f","target":"graph","created_at":"2026-05-17T23:44:35Z","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 studies a deep learning (DL) framework to solve distributed non-convex constrained optimizations in wireless networks where multiple computing nodes, interconnected via backhaul links, desire to determine an efficient assignment of their states based on local observations. Two different configurations are considered: First, an infinite-capacity backhaul enables nodes to communicate in a lossless way, thereby obtaining the solution by centralized computations. Second, a practical finite-capacity backhaul leads to the deployment of distributed solvers equipped along with quantizers fo","authors_text":"Hoon Lee, Sang Hyun Lee, Tony Q. S. Quek","cross_cats":["cs.LG","eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-31T01:54:53Z","title":"Deep Learning for Distributed Optimization: Applications to Wireless Resource Management"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13378","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:4cc24cfad9eb5c08a5a45c0b8175edd410d09c450540fad8739afae16081f531","target":"record","created_at":"2026-05-17T23:44:35Z","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":"c2cc53250d6968ff1393f29ffa4f3d7d725bd0ba205662e990ac0d71ea8e382a","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-31T01:54:53Z","title_canon_sha256":"fa0de11f837f0a1e906c6822a265c4e44fb388c564475ec8016299cd85872369"},"schema_version":"1.0","source":{"id":"1905.13378","kind":"arxiv","version":1}},"canonical_sha256":"2da569317c42a9fe48d4770cd39a370a4c2a2a74e4ace425813638c52ca15c07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2da569317c42a9fe48d4770cd39a370a4c2a2a74e4ace425813638c52ca15c07","first_computed_at":"2026-05-17T23:44:35.109423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:35.109423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"myQCgofCoIutIxM/1hCkz8YfJYqot9TIAAP+3AB235ENKergX3+T2QKmG37Be0YHFsAk+WNlNjB8AuY3nhZBAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:35.110034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cc24cfad9eb5c08a5a45c0b8175edd410d09c450540fad8739afae16081f531","sha256:fc94f05a085b657ffa072353abd67bce77ad809787e3e60735f6484e13bd387f"],"state_sha256":"068ab6d660f1ba1a3859e51c43e28cca33164267273cb46dfc6e6d18a6c647fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"slQPRUGLzXVQRhyq9TDTZ+kA/ObYKI+J0+OB4EJkec+dwfdoyngTDp9lcAZ45CEPvdYK0NS6nAX+lqFtbyZCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:20:07.150150Z","bundle_sha256":"1e02e10dec52ce4695e10efc53fb59737038ad7c64c5d02e4fa824a7c0e2ab7c"}}