{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RMSMKDMAC4SWC2JWXVBVVWKJLC","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":"37e8d0e572a48b93f0f1da708e13fa8e9f2f1754344346bf15259a0f429c0d99","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-10-21T15:32:42Z","title_canon_sha256":"64feee5f590863ca3ad692944e189cabc67806352e3a2f40bf9edc4dfd190551"},"schema_version":"1.0","source":{"id":"2410.16104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.16104","created_at":"2026-07-05T09:23:29Z"},{"alias_kind":"arxiv_version","alias_value":"2410.16104v1","created_at":"2026-07-05T09:23:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16104","created_at":"2026-07-05T09:23:29Z"},{"alias_kind":"pith_short_12","alias_value":"RMSMKDMAC4SW","created_at":"2026-07-05T09:23:29Z"},{"alias_kind":"pith_short_16","alias_value":"RMSMKDMAC4SWC2JW","created_at":"2026-07-05T09:23:29Z"},{"alias_kind":"pith_short_8","alias_value":"RMSMKDMA","created_at":"2026-07-05T09:23:29Z"}],"graph_snapshots":[{"event_id":"sha256:2d9546c636792e32384cfbfa3b6e6813a62dee476e7985e3db4a5c96024430be","target":"graph","created_at":"2026-07-05T09:23:29Z","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/2410.16104/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimizing network utility in device-to-device networks is typically formulated as a non-convex optimization problem. This paper addresses the scenario where the optimization variables are from a bounded but continuous set, allowing each device to perform power control. The power at each link is optimized to maximize a desired network utility. Specifically, we consider the weighted-sum-rate. The state of the art benchmark for this problem is fractional programming with quadratic transform, known as FPLinQ. We propose a scalarization approach to transform the weighted-sum-rate, developing an it","authors_text":"Giuseppe Caire, Jan Christian Hauffen, Peter Jung","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-10-21T15:32:42Z","title":"A Deep Unfolding-Based Scalarization Approach for Power Control in D2D Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16104","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:072ece6b03af17d640cc16603f0fae2e8f8478b97a63b96a2451115659a24f2b","target":"record","created_at":"2026-07-05T09:23:29Z","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":"37e8d0e572a48b93f0f1da708e13fa8e9f2f1754344346bf15259a0f429c0d99","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-10-21T15:32:42Z","title_canon_sha256":"64feee5f590863ca3ad692944e189cabc67806352e3a2f40bf9edc4dfd190551"},"schema_version":"1.0","source":{"id":"2410.16104","kind":"arxiv","version":1}},"canonical_sha256":"8b24c50d801725616936bd435ad94958b5a8028977fd1173b9a23b081a7123b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b24c50d801725616936bd435ad94958b5a8028977fd1173b9a23b081a7123b9","first_computed_at":"2026-07-05T09:23:29.370721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:23:29.370721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MU0pUd0W97jZTWZRTHe8StC6rRxxkkJXsMHixNpD3R+ZVRmABkr85juSr5qKJ8JzuMgGuRnvWcVo09btguUWBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:23:29.371213Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.16104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:072ece6b03af17d640cc16603f0fae2e8f8478b97a63b96a2451115659a24f2b","sha256:2d9546c636792e32384cfbfa3b6e6813a62dee476e7985e3db4a5c96024430be"],"state_sha256":"e6974d1c59eaf1b57ee3090b72ba3d6f945fb23a005a1223553ff83d93289649"}