{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:C4UDEVEUMETU2UNIODJWZYDIVL","short_pith_number":"pith:C4UDEVEU","schema_version":"1.0","canonical_sha256":"172832549461274d51a870d36ce068aafc0a337d153cdf8c97dcee23542e2261","source":{"kind":"arxiv","id":"2502.00053","version":1},"attestation_state":"computed","paper":{"title":"Differentiable Projection-based Learn to Optimize in Wireless Network-Part I: Convex Constrained (Non-)Convex Programming","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","cs.SY"],"primary_cat":"eess.SY","authors_text":"Nan Cheng, Xiucheng Wang, Xuan Zhao","submitted_at":"2025-01-29T11:52:27Z","abstract_excerpt":"This paper addresses a class of (non-)convex optimization problems subject to general convex constraints, which pose significant challenges for traditional methods due to their inherent non-convexity and diversity. Conventional convex optimization-based solvers often struggle to efficiently handle these problems in their most general form. While neural network (NN)-based approaches offer a promising alternative, ensuring the feasibility of NN-generated solutions and effectively training the NN remain key hurdles, largely because finite-capacity networks can produce infeasible outputs. To overc"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.00053","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SY","submitted_at":"2025-01-29T11:52:27Z","cross_cats_sorted":["cs.LG","cs.SY"],"title_canon_sha256":"1ad9fabee64c8f9358d02aea2a3998428d6bef4d98954797e6dd3d0d10dbaf34","abstract_canon_sha256":"409fc8e2410e9725b9c09989f2a55511a1f5e048a2b0e68ef306a5add9d1d6ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:02.254363Z","signature_b64":"wHqciVng4lYUEhtCsvj3EY8h501de9KHrLZdbD720ldF4kwasm14lDuzXpaIKSs4ILkDQC3F7YOWDosRJNd4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"172832549461274d51a870d36ce068aafc0a337d153cdf8c97dcee23542e2261","last_reissued_at":"2026-07-05T10:08:02.253983Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:02.253983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentiable Projection-based Learn to Optimize in Wireless Network-Part I: Convex Constrained (Non-)Convex Programming","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","cs.SY"],"primary_cat":"eess.SY","authors_text":"Nan Cheng, Xiucheng Wang, Xuan Zhao","submitted_at":"2025-01-29T11:52:27Z","abstract_excerpt":"This paper addresses a class of (non-)convex optimization problems subject to general convex constraints, which pose significant challenges for traditional methods due to their inherent non-convexity and diversity. Conventional convex optimization-based solvers often struggle to efficiently handle these problems in their most general form. While neural network (NN)-based approaches offer a promising alternative, ensuring the feasibility of NN-generated solutions and effectively training the NN remain key hurdles, largely because finite-capacity networks can produce infeasible outputs. To overc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00053","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.00053/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.00053","created_at":"2026-07-05T10:08:02.254046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.00053v1","created_at":"2026-07-05T10:08:02.254046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00053","created_at":"2026-07-05T10:08:02.254046+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4UDEVEUMETU","created_at":"2026-07-05T10:08:02.254046+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4UDEVEUMETU2UNI","created_at":"2026-07-05T10:08:02.254046+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4UDEVEU","created_at":"2026-07-05T10:08:02.254046+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.09017","citing_title":"Multimodal Large Language Model Enabled Robust Beamforming for HAP Downlink Communications","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C4UDEVEUMETU2UNIODJWZYDIVL","json":"https://pith.science/pith/C4UDEVEUMETU2UNIODJWZYDIVL.json","graph_json":"https://pith.science/api/pith-number/C4UDEVEUMETU2UNIODJWZYDIVL/graph.json","events_json":"https://pith.science/api/pith-number/C4UDEVEUMETU2UNIODJWZYDIVL/events.json","paper":"https://pith.science/paper/C4UDEVEU"},"agent_actions":{"view_html":"https://pith.science/pith/C4UDEVEUMETU2UNIODJWZYDIVL","download_json":"https://pith.science/pith/C4UDEVEUMETU2UNIODJWZYDIVL.json","view_paper":"https://pith.science/paper/C4UDEVEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.00053&json=true","fetch_graph":"https://pith.science/api/pith-number/C4UDEVEUMETU2UNIODJWZYDIVL/graph.json","fetch_events":"https://pith.science/api/pith-number/C4UDEVEUMETU2UNIODJWZYDIVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4UDEVEUMETU2UNIODJWZYDIVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4UDEVEUMETU2UNIODJWZYDIVL/action/storage_attestation","attest_author":"https://pith.science/pith/C4UDEVEUMETU2UNIODJWZYDIVL/action/author_attestation","sign_citation":"https://pith.science/pith/C4UDEVEUMETU2UNIODJWZYDIVL/action/citation_signature","submit_replication":"https://pith.science/pith/C4UDEVEUMETU2UNIODJWZYDIVL/action/replication_record"}},"created_at":"2026-07-05T10:08:02.254046+00:00","updated_at":"2026-07-05T10:08:02.254046+00:00"}