{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:2DJL22QV7T3EIMOPON6X3HKK5D","short_pith_number":"pith:2DJL22QV","schema_version":"1.0","canonical_sha256":"d0d2bd6a15fcf64431cf737d7d9d4ae8c2b0de3d51c27a879dfe32b85b496a5d","source":{"kind":"arxiv","id":"math-ph/0609050","version":2},"attestation_state":"computed","paper":{"title":"How to generate random matrices from the classical compact groups","license":"","headline":"","cross_cats":["cs.NA","math.MP","math.NA"],"primary_cat":"math-ph","authors_text":"Francesco Mezzadri","submitted_at":"2006-09-18T11:18:42Z","abstract_excerpt":"We discuss how to generate random unitary matrices from the classical compact groups U(N), O(N) and USp(N) with probability distributions given by the respective invariant measures. The algorithm is straightforward to implement using standard linear algebra packages. This approach extends to the Dyson circular ensembles too. This article is based on a lecture given by the author at the summer school on Number Theory and Random Matrix Theory held at the University of Rochester in June 2006. The exposition is addressed to a general mathematical audience."},"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":"math-ph/0609050","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math-ph","submitted_at":"2006-09-18T11:18:42Z","cross_cats_sorted":["cs.NA","math.MP","math.NA"],"title_canon_sha256":"543ac6f00ba65709c2f33ef88eefb29a1d459b74d58089aed0cf1df708696e04","abstract_canon_sha256":"30d12fd7b9ba8094e790b229f3c74d7ce9275424c56657a329c2c9ccc8357750"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:14.852876Z","signature_b64":"JQWHNdVIQhKDAqL5uON3pIBIXVjTk/tAQ4zFXFcTC/JmKthr73vXt/G1VWfp4mH8zlHI6csnrYk13aC5TFEPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0d2bd6a15fcf64431cf737d7d9d4ae8c2b0de3d51c27a879dfe32b85b496a5d","last_reissued_at":"2026-06-03T22:06:14.852447Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:14.852447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to generate random matrices from the classical compact groups","license":"","headline":"","cross_cats":["cs.NA","math.MP","math.NA"],"primary_cat":"math-ph","authors_text":"Francesco Mezzadri","submitted_at":"2006-09-18T11:18:42Z","abstract_excerpt":"We discuss how to generate random unitary matrices from the classical compact groups U(N), O(N) and USp(N) with probability distributions given by the respective invariant measures. The algorithm is straightforward to implement using standard linear algebra packages. This approach extends to the Dyson circular ensembles too. This article is based on a lecture given by the author at the summer school on Number Theory and Random Matrix Theory held at the University of Rochester in June 2006. The exposition is addressed to a general mathematical audience."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math-ph/0609050","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math-ph/0609050/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":"math-ph/0609050","created_at":"2026-06-03T22:06:14.852507+00:00"},{"alias_kind":"arxiv_version","alias_value":"math-ph/0609050v2","created_at":"2026-06-03T22:06:14.852507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math-ph/0609050","created_at":"2026-06-03T22:06:14.852507+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DJL22QV7T3E","created_at":"2026-06-03T22:06:14.852507+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DJL22QV7T3EIMOP","created_at":"2026-06-03T22:06:14.852507+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DJL22QV","created_at":"2026-06-03T22:06:14.852507+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":12,"internal_anchor_count":10,"sample":[{"citing_arxiv_id":"2606.28169","citing_title":"Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm","ref_index":98,"is_internal_anchor":true},{"citing_arxiv_id":"2606.00358","citing_title":"Software compensation of trigger-synchronous control-frame errors in qubits and qudits","ref_index":58,"is_internal_anchor":true},{"citing_arxiv_id":"2606.08928","citing_title":"The Singular Values of L\\'evy's Area Matrix","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2309.06577","citing_title":"Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2604.09095","citing_title":"GeoPAS: Geometric Probing for Algorithm Selection in Continuous Black-Box Optimization","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2512.22997","citing_title":"Generalised Entanglement Entropies from Unit-Invariant Singular Value Decomposition","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2506.20730","citing_title":"Engineering Precise and Robust Effective Hamiltonians","ref_index":104,"is_internal_anchor":true},{"citing_arxiv_id":"2507.17648","citing_title":"Reconstructing the unitary part of a noisy quantum channel","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2601.07824","citing_title":"Computing quantum magic of state vectors","ref_index":110,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12615","citing_title":"Quantum state isomorphism problems for groups","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08844","citing_title":"Signature Kernel and Schwinger-Dyson Kernel Equations as Two-Parameter Rough Differential Equations","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09095","citing_title":"GeoPAS: Geometric Probing for Algorithm Selection in Continuous Black-Box Optimization","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2DJL22QV7T3EIMOPON6X3HKK5D","json":"https://pith.science/pith/2DJL22QV7T3EIMOPON6X3HKK5D.json","graph_json":"https://pith.science/api/pith-number/2DJL22QV7T3EIMOPON6X3HKK5D/graph.json","events_json":"https://pith.science/api/pith-number/2DJL22QV7T3EIMOPON6X3HKK5D/events.json","paper":"https://pith.science/paper/2DJL22QV"},"agent_actions":{"view_html":"https://pith.science/pith/2DJL22QV7T3EIMOPON6X3HKK5D","download_json":"https://pith.science/pith/2DJL22QV7T3EIMOPON6X3HKK5D.json","view_paper":"https://pith.science/paper/2DJL22QV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math-ph/0609050&json=true","fetch_graph":"https://pith.science/api/pith-number/2DJL22QV7T3EIMOPON6X3HKK5D/graph.json","fetch_events":"https://pith.science/api/pith-number/2DJL22QV7T3EIMOPON6X3HKK5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DJL22QV7T3EIMOPON6X3HKK5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DJL22QV7T3EIMOPON6X3HKK5D/action/storage_attestation","attest_author":"https://pith.science/pith/2DJL22QV7T3EIMOPON6X3HKK5D/action/author_attestation","sign_citation":"https://pith.science/pith/2DJL22QV7T3EIMOPON6X3HKK5D/action/citation_signature","submit_replication":"https://pith.science/pith/2DJL22QV7T3EIMOPON6X3HKK5D/action/replication_record"}},"created_at":"2026-06-03T22:06:14.852507+00:00","updated_at":"2026-06-03T22:06:14.852507+00:00"}