{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:NFZK3JLZEVPYN4AASZASV7PPYC","short_pith_number":"pith:NFZK3JLZ","schema_version":"1.0","canonical_sha256":"6972ada579255f86f00096412afdefc0941193e6d9df48dfc5facd2787042694","source":{"kind":"arxiv","id":"quant-ph/0505128","version":2},"attestation_state":"computed","paper":{"title":"A constructive algorithm for the Cartan decomposition of SU(2^N)","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Henrique N. S\\'a Earp, Jiannis K. Pachos","submitted_at":"2005-05-17T14:24:08Z","abstract_excerpt":"We present an explicit numerical method to obtain the Cartan-Khaneja-Glaser decomposition of a general element G of SU(2^N) in terms of its `Cartan' and `non-Cartan' components. This effectively factors G in terms of group elements that belong in SU(2^n) with n<N, a procedure that can be iterated down to n=2. We show that every step reduces to solving the zeros of a matrix polynomial, obtained by truncation of the Baker-Campbell-Hausdorff formula, numerically. All computational tasks involved are straightforward and the overall truncation errors are well under control."},"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":"quant-ph/0505128","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-05-17T14:24:08Z","cross_cats_sorted":[],"title_canon_sha256":"e2a62f85a8b48b08dd40bbfccea73281932c0b4f6ccca47d2b4f065e6cd38c22","abstract_canon_sha256":"1d18b41c97f62acf12819e2f33a1b92a32e540049dadcd65631894a4f2f22977"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:00.922829Z","signature_b64":"HQL27zdui1jppiqC5ENCkC4nalZxzs9Nq15C3/Q4TEQfN6g1KOwfbQCBzXpP2nlKyuLpwqIIAdov6D9uLnzrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6972ada579255f86f00096412afdefc0941193e6d9df48dfc5facd2787042694","last_reissued_at":"2026-05-18T04:12:00.922349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:00.922349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A constructive algorithm for the Cartan decomposition of SU(2^N)","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Henrique N. S\\'a Earp, Jiannis K. Pachos","submitted_at":"2005-05-17T14:24:08Z","abstract_excerpt":"We present an explicit numerical method to obtain the Cartan-Khaneja-Glaser decomposition of a general element G of SU(2^N) in terms of its `Cartan' and `non-Cartan' components. This effectively factors G in terms of group elements that belong in SU(2^n) with n<N, a procedure that can be iterated down to n=2. We show that every step reduces to solving the zeros of a matrix polynomial, obtained by truncation of the Baker-Campbell-Hausdorff formula, numerically. All computational tasks involved are straightforward and the overall truncation errors are well under control."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0505128","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":"quant-ph/0505128","created_at":"2026-05-18T04:12:00.922429+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0505128v2","created_at":"2026-05-18T04:12:00.922429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0505128","created_at":"2026-05-18T04:12:00.922429+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFZK3JLZEVPY","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFZK3JLZEVPYN4AA","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFZK3JLZ","created_at":"2026-05-18T12:25:53.335082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10783","citing_title":"On the KAK Decomposition and Equivalence Classes","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NFZK3JLZEVPYN4AASZASV7PPYC","json":"https://pith.science/pith/NFZK3JLZEVPYN4AASZASV7PPYC.json","graph_json":"https://pith.science/api/pith-number/NFZK3JLZEVPYN4AASZASV7PPYC/graph.json","events_json":"https://pith.science/api/pith-number/NFZK3JLZEVPYN4AASZASV7PPYC/events.json","paper":"https://pith.science/paper/NFZK3JLZ"},"agent_actions":{"view_html":"https://pith.science/pith/NFZK3JLZEVPYN4AASZASV7PPYC","download_json":"https://pith.science/pith/NFZK3JLZEVPYN4AASZASV7PPYC.json","view_paper":"https://pith.science/paper/NFZK3JLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0505128&json=true","fetch_graph":"https://pith.science/api/pith-number/NFZK3JLZEVPYN4AASZASV7PPYC/graph.json","fetch_events":"https://pith.science/api/pith-number/NFZK3JLZEVPYN4AASZASV7PPYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFZK3JLZEVPYN4AASZASV7PPYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFZK3JLZEVPYN4AASZASV7PPYC/action/storage_attestation","attest_author":"https://pith.science/pith/NFZK3JLZEVPYN4AASZASV7PPYC/action/author_attestation","sign_citation":"https://pith.science/pith/NFZK3JLZEVPYN4AASZASV7PPYC/action/citation_signature","submit_replication":"https://pith.science/pith/NFZK3JLZEVPYN4AASZASV7PPYC/action/replication_record"}},"created_at":"2026-05-18T04:12:00.922429+00:00","updated_at":"2026-05-18T04:12:00.922429+00:00"}