{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:QDXK63J643RXSJ6JMAZJOM24NV","short_pith_number":"pith:QDXK63J6","schema_version":"1.0","canonical_sha256":"80eeaf6d3ee6e37927c9603297335c6d50f8af354077838a031d39aaeb0acab0","source":{"kind":"arxiv","id":"0707.1838","version":3},"attestation_state":"computed","paper":{"title":"Computing the complete CS decomposition","license":"","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Brian D. Sutton","submitted_at":"2007-07-12T17:26:40Z","abstract_excerpt":"An algorithm is developed to compute the complete CS decomposition (CSD) of a partitioned unitary matrix. Although the existence of the CSD has been recognized since 1977, prior algorithms compute only a reduced version (the 2-by-1 CSD) that is equivalent to two simultaneous singular value decompositions. The algorithm presented here computes the complete 2-by-2 CSD, which requires the simultaneous diagonalization of all four blocks of a unitary matrix partitioned into a 2-by-2 block structure. The algorithm appears to be the only fully specified algorithm available. The computation occurs in "},"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":"0707.1838","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2007-07-12T17:26:40Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"b96e77cd7bbc1e2440d03b13c541c9262da8f2b50f7681998b4e5aa4a38231a2","abstract_canon_sha256":"1ffa32a16aa0d8ac522b85534ce73b87e8c98c9eacca961ef4b46d7334ab9505"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:01.542961Z","signature_b64":"xzoLtE8EbgUGHoOsmr28oZD++2iQ+uMTxQidQ4eFWkWFNL7/q0fBseVYZBpgoB34d2SZhXbPp8QmZkW0zh71CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80eeaf6d3ee6e37927c9603297335c6d50f8af354077838a031d39aaeb0acab0","last_reissued_at":"2026-06-03T22:06:01.542366Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:01.542366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the complete CS decomposition","license":"","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Brian D. Sutton","submitted_at":"2007-07-12T17:26:40Z","abstract_excerpt":"An algorithm is developed to compute the complete CS decomposition (CSD) of a partitioned unitary matrix. Although the existence of the CSD has been recognized since 1977, prior algorithms compute only a reduced version (the 2-by-1 CSD) that is equivalent to two simultaneous singular value decompositions. The algorithm presented here computes the complete 2-by-2 CSD, which requires the simultaneous diagonalization of all four blocks of a unitary matrix partitioned into a 2-by-2 block structure. The algorithm appears to be the only fully specified algorithm available. The computation occurs in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.1838","kind":"arxiv","version":3},"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/0707.1838/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":"0707.1838","created_at":"2026-06-03T22:06:01.542432+00:00"},{"alias_kind":"arxiv_version","alias_value":"0707.1838v3","created_at":"2026-06-03T22:06:01.542432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.1838","created_at":"2026-06-03T22:06:01.542432+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDXK63J643RX","created_at":"2026-06-03T22:06:01.542432+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDXK63J643RXSJ6J","created_at":"2026-06-03T22:06:01.542432+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDXK63J6","created_at":"2026-06-03T22:06:01.542432+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/QDXK63J643RXSJ6JMAZJOM24NV","json":"https://pith.science/pith/QDXK63J643RXSJ6JMAZJOM24NV.json","graph_json":"https://pith.science/api/pith-number/QDXK63J643RXSJ6JMAZJOM24NV/graph.json","events_json":"https://pith.science/api/pith-number/QDXK63J643RXSJ6JMAZJOM24NV/events.json","paper":"https://pith.science/paper/QDXK63J6"},"agent_actions":{"view_html":"https://pith.science/pith/QDXK63J643RXSJ6JMAZJOM24NV","download_json":"https://pith.science/pith/QDXK63J643RXSJ6JMAZJOM24NV.json","view_paper":"https://pith.science/paper/QDXK63J6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0707.1838&json=true","fetch_graph":"https://pith.science/api/pith-number/QDXK63J643RXSJ6JMAZJOM24NV/graph.json","fetch_events":"https://pith.science/api/pith-number/QDXK63J643RXSJ6JMAZJOM24NV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDXK63J643RXSJ6JMAZJOM24NV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDXK63J643RXSJ6JMAZJOM24NV/action/storage_attestation","attest_author":"https://pith.science/pith/QDXK63J643RXSJ6JMAZJOM24NV/action/author_attestation","sign_citation":"https://pith.science/pith/QDXK63J643RXSJ6JMAZJOM24NV/action/citation_signature","submit_replication":"https://pith.science/pith/QDXK63J643RXSJ6JMAZJOM24NV/action/replication_record"}},"created_at":"2026-06-03T22:06:01.542432+00:00","updated_at":"2026-06-03T22:06:01.542432+00:00"}