{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7WK2U5EBNXBYC74RCGD2G3IZPK","short_pith_number":"pith:7WK2U5EB","schema_version":"1.0","canonical_sha256":"fd95aa74816dc3817f911187a36d197a845a1871db07d13903a2dd944f5efb69","source":{"kind":"arxiv","id":"2606.06982","version":1},"attestation_state":"computed","paper":{"title":"Mutual Information Optimization via K-Recursion and Automatic Differentiation for Linear Gaussian Wireless Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Na Siqi, Tadashi Wadayama","submitted_at":"2026-06-05T07:18:12Z","abstract_excerpt":"We present a differentiable framework for end-to-end mutual information (MI) optimization over linear Gaussian directed acyclic graphs (DAGs). The framework targets network-wide design under global constraints, such as a total transmit power budget, and covers MIMO precoding, amplify-and-forward relays, RIS-aided channels, and branching/merging topologies within a common linear Gaussian model. Its core ingredient is a \\emph{K-recursion} that analytically propagates all node-pair covariances along the DAG in topological order, including non-adjacent cross-covariances that are necessary for corr"},"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":"2606.06982","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-05T07:18:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9aaa4cfd771ec83bf1f3215ec70361a5478c5eac3ed464f8f19870fb0fd201cb","abstract_canon_sha256":"84ce29487239a5157ff590ee7fc8132f3e37b90898b54158f14bbc4a44660c99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:39.415395Z","signature_b64":"HadZjdGvaiIgnbo1jlm731dE/n1Ptm9wGfU3vt81YSt2YZWrYPpQA79TE7rDq0W2kBm7Agp+L80LxiTnCEQBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd95aa74816dc3817f911187a36d197a845a1871db07d13903a2dd944f5efb69","last_reissued_at":"2026-06-08T01:04:39.414520Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:39.414520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mutual Information Optimization via K-Recursion and Automatic Differentiation for Linear Gaussian Wireless Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Na Siqi, Tadashi Wadayama","submitted_at":"2026-06-05T07:18:12Z","abstract_excerpt":"We present a differentiable framework for end-to-end mutual information (MI) optimization over linear Gaussian directed acyclic graphs (DAGs). The framework targets network-wide design under global constraints, such as a total transmit power budget, and covers MIMO precoding, amplify-and-forward relays, RIS-aided channels, and branching/merging topologies within a common linear Gaussian model. Its core ingredient is a \\emph{K-recursion} that analytically propagates all node-pair covariances along the DAG in topological order, including non-adjacent cross-covariances that are necessary for corr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06982","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/2606.06982/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":"2606.06982","created_at":"2026-06-08T01:04:39.414624+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06982v1","created_at":"2026-06-08T01:04:39.414624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06982","created_at":"2026-06-08T01:04:39.414624+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WK2U5EBNXBY","created_at":"2026-06-08T01:04:39.414624+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WK2U5EBNXBYC74R","created_at":"2026-06-08T01:04:39.414624+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WK2U5EB","created_at":"2026-06-08T01:04:39.414624+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/7WK2U5EBNXBYC74RCGD2G3IZPK","json":"https://pith.science/pith/7WK2U5EBNXBYC74RCGD2G3IZPK.json","graph_json":"https://pith.science/api/pith-number/7WK2U5EBNXBYC74RCGD2G3IZPK/graph.json","events_json":"https://pith.science/api/pith-number/7WK2U5EBNXBYC74RCGD2G3IZPK/events.json","paper":"https://pith.science/paper/7WK2U5EB"},"agent_actions":{"view_html":"https://pith.science/pith/7WK2U5EBNXBYC74RCGD2G3IZPK","download_json":"https://pith.science/pith/7WK2U5EBNXBYC74RCGD2G3IZPK.json","view_paper":"https://pith.science/paper/7WK2U5EB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06982&json=true","fetch_graph":"https://pith.science/api/pith-number/7WK2U5EBNXBYC74RCGD2G3IZPK/graph.json","fetch_events":"https://pith.science/api/pith-number/7WK2U5EBNXBYC74RCGD2G3IZPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WK2U5EBNXBYC74RCGD2G3IZPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WK2U5EBNXBYC74RCGD2G3IZPK/action/storage_attestation","attest_author":"https://pith.science/pith/7WK2U5EBNXBYC74RCGD2G3IZPK/action/author_attestation","sign_citation":"https://pith.science/pith/7WK2U5EBNXBYC74RCGD2G3IZPK/action/citation_signature","submit_replication":"https://pith.science/pith/7WK2U5EBNXBYC74RCGD2G3IZPK/action/replication_record"}},"created_at":"2026-06-08T01:04:39.414624+00:00","updated_at":"2026-06-08T01:04:39.414624+00:00"}