{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XNTPSHD6CVMQSWZZVBS3U7X5NS","short_pith_number":"pith:XNTPSHD6","schema_version":"1.0","canonical_sha256":"bb66f91c7e1559095b39a865ba7efd6c9c34eca4d90e9a023f927590daf7b736","source":{"kind":"arxiv","id":"1112.4446","version":1},"attestation_state":"computed","paper":{"title":"Simultaneous unitary equivalences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"Roger A. Horn, Tatiana G. Gerasimova, Vladimir V. Sergeichuk","submitted_at":"2011-12-19T19:51:23Z","abstract_excerpt":"Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily similar via U, each pair of matrices in B is unitarily congruent via U, each pair of matrices in C is unitarily similar via \\bar{U}, and each pair of matrices in D is unitarily congruent via \\bar{U}."},"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":"1112.4446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2011-12-19T19:51:23Z","cross_cats_sorted":[],"title_canon_sha256":"15a86c00063314e9e5239f443562dc89bbfe9e3d6d1640d390f2803930e146e4","abstract_canon_sha256":"a4ad800bf38f6a0160c29c158b3309d18b1bd8f7082054976f2b1dec3e05222c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:44.591473Z","signature_b64":"9I5/PnVRmuKLLRDEztsEvGS4r4n5+PDTBgWBO/BFIOW34ljHXFaUfJU2ZIJy1BcE3A2IoZDLhtrauV3RWdNaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb66f91c7e1559095b39a865ba7efd6c9c34eca4d90e9a023f927590daf7b736","last_reissued_at":"2026-05-18T02:56:44.591030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:44.591030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous unitary equivalences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"Roger A. Horn, Tatiana G. Gerasimova, Vladimir V. Sergeichuk","submitted_at":"2011-12-19T19:51:23Z","abstract_excerpt":"Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily similar via U, each pair of matrices in B is unitarily congruent via U, each pair of matrices in C is unitarily similar via \\bar{U}, and each pair of matrices in D is unitarily congruent via \\bar{U}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4446","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":""},"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":"1112.4446","created_at":"2026-05-18T02:56:44.591093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.4446v1","created_at":"2026-05-18T02:56:44.591093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4446","created_at":"2026-05-18T02:56:44.591093+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNTPSHD6CVMQ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNTPSHD6CVMQSWZZ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNTPSHD6","created_at":"2026-05-18T12:26:47.523578+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/XNTPSHD6CVMQSWZZVBS3U7X5NS","json":"https://pith.science/pith/XNTPSHD6CVMQSWZZVBS3U7X5NS.json","graph_json":"https://pith.science/api/pith-number/XNTPSHD6CVMQSWZZVBS3U7X5NS/graph.json","events_json":"https://pith.science/api/pith-number/XNTPSHD6CVMQSWZZVBS3U7X5NS/events.json","paper":"https://pith.science/paper/XNTPSHD6"},"agent_actions":{"view_html":"https://pith.science/pith/XNTPSHD6CVMQSWZZVBS3U7X5NS","download_json":"https://pith.science/pith/XNTPSHD6CVMQSWZZVBS3U7X5NS.json","view_paper":"https://pith.science/paper/XNTPSHD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.4446&json=true","fetch_graph":"https://pith.science/api/pith-number/XNTPSHD6CVMQSWZZVBS3U7X5NS/graph.json","fetch_events":"https://pith.science/api/pith-number/XNTPSHD6CVMQSWZZVBS3U7X5NS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNTPSHD6CVMQSWZZVBS3U7X5NS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNTPSHD6CVMQSWZZVBS3U7X5NS/action/storage_attestation","attest_author":"https://pith.science/pith/XNTPSHD6CVMQSWZZVBS3U7X5NS/action/author_attestation","sign_citation":"https://pith.science/pith/XNTPSHD6CVMQSWZZVBS3U7X5NS/action/citation_signature","submit_replication":"https://pith.science/pith/XNTPSHD6CVMQSWZZVBS3U7X5NS/action/replication_record"}},"created_at":"2026-05-18T02:56:44.591093+00:00","updated_at":"2026-05-18T02:56:44.591093+00:00"}