{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AECQQRVZO4WRIIGP6JJXVQ4G2M","short_pith_number":"pith:AECQQRVZ","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"},"canonical_sha256":"01050846b9772d1420cff2537ac386d3310aadf83dfe23f0fadb226aab6b45b0","source":{"kind":"arxiv","id":"1708.01833","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01833","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01833v2","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01833","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"AECQQRVZO4WR","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AECQQRVZO4WRIIGP","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AECQQRVZ","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AECQQRVZO4WRIIGP6JJXVQ4G2M","target":"record","payload":{"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"},"canonical_sha256":"01050846b9772d1420cff2537ac386d3310aadf83dfe23f0fadb226aab6b45b0","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"},"source_kind":"arxiv","source_id":"1708.01833","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIdQ6Z3lfjN3SPsKOJgYY86ITBtkTgh70ZgZRysGQQBeqtZAPYpMygOGCsNarHn4Kj/SvluMCLw8aJEWFaihCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:11:53.757409Z"},"content_sha256":"b5567262f05f74ae78878739a2d413e3e27a92285c2245e5aca12d5d06fab463","schema_version":"1.0","event_id":"sha256:b5567262f05f74ae78878739a2d413e3e27a92285c2245e5aca12d5d06fab463"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AECQQRVZO4WRIIGP6JJXVQ4G2M","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DgybKDUA+gMa8NvOrGliKr2yPQ/48weYQzJCHji3NXuMe91y6J8Xhm2gLa/F67fPKCcLRw62SOSko9nWb6RxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:11:53.757764Z"},"content_sha256":"93ca9cb3dcdbc0b9e68682040ffe798b36b61a8c6107f584f5903813bf0a1096","schema_version":"1.0","event_id":"sha256:93ca9cb3dcdbc0b9e68682040ffe798b36b61a8c6107f584f5903813bf0a1096"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M/bundle.json","state_url":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T20:11:53Z","links":{"resolver":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M","bundle":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M/bundle.json","state":"https://pith.science/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AECQQRVZO4WRIIGP6JJXVQ4G2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AECQQRVZO4WRIIGP6JJXVQ4G2M","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":"db0a4d9455d2fded6f8641e6a7ef8431952b66c732d1350a6905a18a7a362a59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-06T02:02:58Z","title_canon_sha256":"4f46369d2e5ba8e42a5334e7631d95281398244dc849bc8eee2e412db38dc6a3"},"schema_version":"1.0","source":{"id":"1708.01833","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01833","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01833v2","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01833","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"AECQQRVZO4WR","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AECQQRVZO4WRIIGP","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AECQQRVZ","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:93ca9cb3dcdbc0b9e68682040ffe798b36b61a8c6107f584f5903813bf0a1096","target":"graph","created_at":"2026-05-18T00:13:47Z","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"},"paper":{"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","authors_text":"Jie Chen, Shu Liang, Xianlin Zeng, Yiguang Hong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-06T02:02:58Z","title":"Distributed Computation of Linear Matrix Equations: An Optimization Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01833","kind":"arxiv","version":2},"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:b5567262f05f74ae78878739a2d413e3e27a92285c2245e5aca12d5d06fab463","target":"record","created_at":"2026-05-18T00:13:47Z","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":"db0a4d9455d2fded6f8641e6a7ef8431952b66c732d1350a6905a18a7a362a59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-06T02:02:58Z","title_canon_sha256":"4f46369d2e5ba8e42a5334e7631d95281398244dc849bc8eee2e412db38dc6a3"},"schema_version":"1.0","source":{"id":"1708.01833","kind":"arxiv","version":2}},"canonical_sha256":"01050846b9772d1420cff2537ac386d3310aadf83dfe23f0fadb226aab6b45b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01050846b9772d1420cff2537ac386d3310aadf83dfe23f0fadb226aab6b45b0","first_computed_at":"2026-05-18T00:13:47.745240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:47.745240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VEJMwtwDbf/cNJlHRmqDqMXNT2zXvEyZc4mmQEYtMJHgzrmCctcL6+NRtrEmsAeiG5J1EjbfhqT0cOSqT5FzAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:47.746087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01833","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5567262f05f74ae78878739a2d413e3e27a92285c2245e5aca12d5d06fab463","sha256:93ca9cb3dcdbc0b9e68682040ffe798b36b61a8c6107f584f5903813bf0a1096"],"state_sha256":"988109b0f8812ee1daa76b060709e3967c80d1e02903f169b06c5543829ce9d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kNRfsJ6TdFHvcvZSLika4sJnaH39CFGFtb3yd2RTsSZJrSnwK0Wo7QNd3xlKNZ7hyPB21L4B+O2wbRlPwvIXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:11:53.759696Z","bundle_sha256":"a021c896684bf7a5cc1249cbb80d453cb14118d8ff57be422700ca49a6d7fe54"}}