{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:I3LW4UKFWCJ2OUXCCFCY7UDR27","short_pith_number":"pith:I3LW4UKF","schema_version":"1.0","canonical_sha256":"46d76e5145b093a752e211458fd071d7d2b9447eeb74826abc6319258010a327","source":{"kind":"arxiv","id":"2502.03162","version":1},"attestation_state":"computed","paper":{"title":"Low-Complexity Cram\\'er-Rao Lower Bound and Sum Rate Optimization in ISAC Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Markku Juntti, Nhan Thanh Nguyen, Tianyu Fang","submitted_at":"2025-02-05T13:34:49Z","abstract_excerpt":"While Cram\\'er-Rao lower bound is an important metric in sensing functions in integrated sensing and communications (ISAC) designs, its optimization usually involves a computationally expensive solution such as semidefinite relaxation. In this paper, we aim to develop a low-complexity yet efficient algorithm for CRLB optimization. We focus on a beamforming design that maximizes the weighted sum between the communications sum rate and the sensing CRLB, subject to a transmit power constraint. Given the non-convexity of this problem, we propose a novel method that combines successive convex appro"},"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.03162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-02-05T13:34:49Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"801b784d714d2af7a4e3d0af79fe38d382f86a384b75c20f3c91bf986d629616","abstract_canon_sha256":"90a9968bae3aeff2f6d5cd8082ca1515f2ba3d520def0e5a35420a81f482716f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:00.715832Z","signature_b64":"kr4XcGMymltoI+4fWTCsXLjvUBXTFKZ37maKUtSuHUEKFDTFvTJT8R5PWFJgcM62WRxjK/8H7pqRNN/Hevn+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46d76e5145b093a752e211458fd071d7d2b9447eeb74826abc6319258010a327","last_reissued_at":"2026-07-05T10:10:00.715352Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:00.715352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Complexity Cram\\'er-Rao Lower Bound and Sum Rate Optimization in ISAC Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Markku Juntti, Nhan Thanh Nguyen, Tianyu Fang","submitted_at":"2025-02-05T13:34:49Z","abstract_excerpt":"While Cram\\'er-Rao lower bound is an important metric in sensing functions in integrated sensing and communications (ISAC) designs, its optimization usually involves a computationally expensive solution such as semidefinite relaxation. In this paper, we aim to develop a low-complexity yet efficient algorithm for CRLB optimization. We focus on a beamforming design that maximizes the weighted sum between the communications sum rate and the sensing CRLB, subject to a transmit power constraint. Given the non-convexity of this problem, we propose a novel method that combines successive convex appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03162","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.03162/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.03162","created_at":"2026-07-05T10:10:00.715415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.03162v1","created_at":"2026-07-05T10:10:00.715415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03162","created_at":"2026-07-05T10:10:00.715415+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3LW4UKFWCJ2","created_at":"2026-07-05T10:10:00.715415+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3LW4UKFWCJ2OUXC","created_at":"2026-07-05T10:10:00.715415+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3LW4UKF","created_at":"2026-07-05T10:10:00.715415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I3LW4UKFWCJ2OUXCCFCY7UDR27","json":"https://pith.science/pith/I3LW4UKFWCJ2OUXCCFCY7UDR27.json","graph_json":"https://pith.science/api/pith-number/I3LW4UKFWCJ2OUXCCFCY7UDR27/graph.json","events_json":"https://pith.science/api/pith-number/I3LW4UKFWCJ2OUXCCFCY7UDR27/events.json","paper":"https://pith.science/paper/I3LW4UKF"},"agent_actions":{"view_html":"https://pith.science/pith/I3LW4UKFWCJ2OUXCCFCY7UDR27","download_json":"https://pith.science/pith/I3LW4UKFWCJ2OUXCCFCY7UDR27.json","view_paper":"https://pith.science/paper/I3LW4UKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.03162&json=true","fetch_graph":"https://pith.science/api/pith-number/I3LW4UKFWCJ2OUXCCFCY7UDR27/graph.json","fetch_events":"https://pith.science/api/pith-number/I3LW4UKFWCJ2OUXCCFCY7UDR27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3LW4UKFWCJ2OUXCCFCY7UDR27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3LW4UKFWCJ2OUXCCFCY7UDR27/action/storage_attestation","attest_author":"https://pith.science/pith/I3LW4UKFWCJ2OUXCCFCY7UDR27/action/author_attestation","sign_citation":"https://pith.science/pith/I3LW4UKFWCJ2OUXCCFCY7UDR27/action/citation_signature","submit_replication":"https://pith.science/pith/I3LW4UKFWCJ2OUXCCFCY7UDR27/action/replication_record"}},"created_at":"2026-07-05T10:10:00.715415+00:00","updated_at":"2026-07-05T10:10:00.715415+00:00"}