{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AECQQRVZO4WRIIGP6JJXVQ4G2M","short_pith_number":"pith:AECQQRVZ","schema_version":"1.0","canonical_sha256":"01050846b9772d1420cff2537ac386d3310aadf83dfe23f0fadb226aab6b45b0","source":{"kind":"arxiv","id":"1708.01833","version":2},"attestation_state":"computed","paper":{"title":"Distributed Computation of Linear Matrix Equations: An Optimization Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Chen, Shu Liang, Xianlin Zeng, Yiguang Hong","submitted_at":"2017-08-06T02:02:58Z","abstract_excerpt":"This paper investigates the distributed computation of the well-known linear matrix equation in the form of $AXB = F$, with the matrices A, B, X, and F of appropriate dimensions, over multi-agent networks from an optimization perspective. In this paper, we consider the standard distributed matrix-information structures, where each agent of the considered multi-agent network has access to one of the sub-block matrices of A, B, and F. To be specific, we first propose different decomposition methods to reformulate the matrix equations in standard structures as distributed constrained optimization"},"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":"1708.01833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-06T02:02:58Z","cross_cats_sorted":[],"title_canon_sha256":"4f46369d2e5ba8e42a5334e7631d95281398244dc849bc8eee2e412db38dc6a3","abstract_canon_sha256":"db0a4d9455d2fded6f8641e6a7ef8431952b66c732d1350a6905a18a7a362a59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:47.746087Z","signature_b64":"VEJMwtwDbf/cNJlHRmqDqMXNT2zXvEyZc4mmQEYtMJHgzrmCctcL6+NRtrEmsAeiG5J1EjbfhqT0cOSqT5FzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01050846b9772d1420cff2537ac386d3310aadf83dfe23f0fadb226aab6b45b0","last_reissued_at":"2026-05-18T00:13:47.745240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:47.745240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Computation of Linear Matrix Equations: An Optimization Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Chen, Shu Liang, Xianlin Zeng, Yiguang Hong","submitted_at":"2017-08-06T02:02:58Z","abstract_excerpt":"This paper investigates the distributed computation of the well-known linear matrix equation in the form of $AXB = F$, with the matrices A, B, X, and F of appropriate dimensions, over multi-agent networks from an optimization perspective. In this paper, we consider the standard distributed matrix-information structures, where each agent of the considered multi-agent network has access to one of the sub-block matrices of A, B, and F. To be specific, we first propose different decomposition methods to reformulate the matrix equations in standard structures as distributed constrained optimization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01833","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.01833","created_at":"2026-05-18T00:13:47.745371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01833v2","created_at":"2026-05-18T00:13:47.745371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01833","created_at":"2026-05-18T00:13:47.745371+00:00"},{"alias_kind":"pith_short_12","alias_value":"AECQQRVZO4WR","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AECQQRVZO4WRIIGP","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AECQQRVZ","created_at":"2026-05-18T12:31:05.417338+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/AECQQRVZO4WRIIGP6JJXVQ4G2M","json":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M.json","graph_json":"https://pith.science/api/pith-number/AECQQRVZO4WRIIGP6JJXVQ4G2M/graph.json","events_json":"https://pith.science/api/pith-number/AECQQRVZO4WRIIGP6JJXVQ4G2M/events.json","paper":"https://pith.science/paper/AECQQRVZ"},"agent_actions":{"view_html":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M","download_json":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M.json","view_paper":"https://pith.science/paper/AECQQRVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01833&json=true","fetch_graph":"https://pith.science/api/pith-number/AECQQRVZO4WRIIGP6JJXVQ4G2M/graph.json","fetch_events":"https://pith.science/api/pith-number/AECQQRVZO4WRIIGP6JJXVQ4G2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M/action/storage_attestation","attest_author":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M/action/author_attestation","sign_citation":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M/action/citation_signature","submit_replication":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M/action/replication_record"}},"created_at":"2026-05-18T00:13:47.745371+00:00","updated_at":"2026-05-18T00:13:47.745371+00:00"}