{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VMD42CDOIYRUFC7HK3TMJE3TGZ","short_pith_number":"pith:VMD42CDO","schema_version":"1.0","canonical_sha256":"ab07cd086e4623428be756e6c49373366b6edad4f26ee4544da10c1f97bf02c0","source":{"kind":"arxiv","id":"1809.00351","version":1},"attestation_state":"computed","paper":{"title":"A fast Metropolis-Hastings method for generating random correlation matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Concha Bielza, Gherardo Varando, Irene C\\'ordoba, Pedro Larra\\~naga","submitted_at":"2018-09-02T14:47:40Z","abstract_excerpt":"We propose a novel Metropolis-Hastings algorithm to sample uniformly from the space of correlation matrices. Existing methods in the literature are based on elaborated representations of a correlation matrix, or on complex parametrizations of it. By contrast, our method is intuitive and simple, based the classical Cholesky factorization of a positive definite matrix and Markov chain Monte Carlo theory. We perform a detailed convergence analysis of the resulting Markov chain, and show how it benefits from fast convergence, both theoretically and empirically. Furthermore, in numerical experiment"},"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":"1809.00351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-09-02T14:47:40Z","cross_cats_sorted":[],"title_canon_sha256":"da297112ffa4422a555b3723b41f5bc72eef3a5dc00a0623bf468fd140b171f8","abstract_canon_sha256":"09f5546ea2d262dc88f9a8b27e0839adcca8c3c702b1911f039ba31868b808b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:12:50.239422Z","signature_b64":"renALJEbD68w7dyOO9rF3srGhMaY0o3iNnk8ForhIThr23CjyRamMTGAaBE8A0AHDBWsscMHEK6LaRKqMCA6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab07cd086e4623428be756e6c49373366b6edad4f26ee4544da10c1f97bf02c0","last_reissued_at":"2026-07-05T00:12:50.238962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:12:50.238962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast Metropolis-Hastings method for generating random correlation matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Concha Bielza, Gherardo Varando, Irene C\\'ordoba, Pedro Larra\\~naga","submitted_at":"2018-09-02T14:47:40Z","abstract_excerpt":"We propose a novel Metropolis-Hastings algorithm to sample uniformly from the space of correlation matrices. Existing methods in the literature are based on elaborated representations of a correlation matrix, or on complex parametrizations of it. By contrast, our method is intuitive and simple, based the classical Cholesky factorization of a positive definite matrix and Markov chain Monte Carlo theory. We perform a detailed convergence analysis of the resulting Markov chain, and show how it benefits from fast convergence, both theoretically and empirically. Furthermore, in numerical experiment"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00351","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1809.00351/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":"1809.00351","created_at":"2026-07-05T00:12:50.239019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00351v1","created_at":"2026-07-05T00:12:50.239019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00351","created_at":"2026-07-05T00:12:50.239019+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMD42CDOIYRU","created_at":"2026-07-05T00:12:50.239019+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMD42CDOIYRUFC7H","created_at":"2026-07-05T00:12:50.239019+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMD42CDO","created_at":"2026-07-05T00:12:50.239019+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/VMD42CDOIYRUFC7HK3TMJE3TGZ","json":"https://pith.science/pith/VMD42CDOIYRUFC7HK3TMJE3TGZ.json","graph_json":"https://pith.science/api/pith-number/VMD42CDOIYRUFC7HK3TMJE3TGZ/graph.json","events_json":"https://pith.science/api/pith-number/VMD42CDOIYRUFC7HK3TMJE3TGZ/events.json","paper":"https://pith.science/paper/VMD42CDO"},"agent_actions":{"view_html":"https://pith.science/pith/VMD42CDOIYRUFC7HK3TMJE3TGZ","download_json":"https://pith.science/pith/VMD42CDOIYRUFC7HK3TMJE3TGZ.json","view_paper":"https://pith.science/paper/VMD42CDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00351&json=true","fetch_graph":"https://pith.science/api/pith-number/VMD42CDOIYRUFC7HK3TMJE3TGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VMD42CDOIYRUFC7HK3TMJE3TGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMD42CDOIYRUFC7HK3TMJE3TGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMD42CDOIYRUFC7HK3TMJE3TGZ/action/storage_attestation","attest_author":"https://pith.science/pith/VMD42CDOIYRUFC7HK3TMJE3TGZ/action/author_attestation","sign_citation":"https://pith.science/pith/VMD42CDOIYRUFC7HK3TMJE3TGZ/action/citation_signature","submit_replication":"https://pith.science/pith/VMD42CDOIYRUFC7HK3TMJE3TGZ/action/replication_record"}},"created_at":"2026-07-05T00:12:50.239019+00:00","updated_at":"2026-07-05T00:12:50.239019+00:00"}