{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NFA4FSJHRQNKQUDDFM3CB7VA7U","short_pith_number":"pith:NFA4FSJH","schema_version":"1.0","canonical_sha256":"6941c2c9278c1aa850632b3620fea0fd0198f73c27593f2d8c519599121c8aa0","source":{"kind":"arxiv","id":"2505.24400","version":1},"attestation_state":"computed","paper":{"title":"An MCMC hypothesis test to check a claimed sampler: applied to a claimed sampler for the G-Wishart distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"H{\\aa}kon Tjelmeland, Hanna Bu Kval{\\o}y","submitted_at":"2025-05-30T09:30:08Z","abstract_excerpt":"Suppose we have a distribution of interest, with density $p(x),x\\in {\\cal X}$ say, and an algorithm\n  claimed to generate samples from $p(x)$. Moreover, assume we have available a Metropolis--Hastings\n  transition kernel fulfilling detail balance with respect to $p(x)$. In such a situation we\n  formulate a hypothesis test where $H_0$ is that the claimed sampler really generates\n  correct samples from $p(x)$. We use that if initialising the Metropolis--Hastings algorithm with a\n  sample generated by the claimed sampler and run the chain for a fixed number of updates, the\n  initial and final sta"},"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":"2505.24400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-05-30T09:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"360e62d94cf9a5653e9d9f76b0b71e6a464ddfc6ea63329b1a4000872337b398","abstract_canon_sha256":"7eada0f68c86c10d3c8156b54971d336abe1dd456af258fc349d52ecb4ec74af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:48.401134Z","signature_b64":"xhNRHe9YK1SI6SyYBz2DNaB5fyZVsqeRCzQqjq1iQ6ZlncjiTRWGT9oPvqbfAEsbVjfYt+Thh+raoLzm1x5lAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6941c2c9278c1aa850632b3620fea0fd0198f73c27593f2d8c519599121c8aa0","last_reissued_at":"2026-07-05T11:12:48.400625Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:48.400625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An MCMC hypothesis test to check a claimed sampler: applied to a claimed sampler for the G-Wishart distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"H{\\aa}kon Tjelmeland, Hanna Bu Kval{\\o}y","submitted_at":"2025-05-30T09:30:08Z","abstract_excerpt":"Suppose we have a distribution of interest, with density $p(x),x\\in {\\cal X}$ say, and an algorithm\n  claimed to generate samples from $p(x)$. Moreover, assume we have available a Metropolis--Hastings\n  transition kernel fulfilling detail balance with respect to $p(x)$. In such a situation we\n  formulate a hypothesis test where $H_0$ is that the claimed sampler really generates\n  correct samples from $p(x)$. We use that if initialising the Metropolis--Hastings algorithm with a\n  sample generated by the claimed sampler and run the chain for a fixed number of updates, the\n  initial and final sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24400","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/2505.24400/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":"2505.24400","created_at":"2026-07-05T11:12:48.400691+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24400v1","created_at":"2026-07-05T11:12:48.400691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24400","created_at":"2026-07-05T11:12:48.400691+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFA4FSJHRQNK","created_at":"2026-07-05T11:12:48.400691+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFA4FSJHRQNKQUDD","created_at":"2026-07-05T11:12:48.400691+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFA4FSJH","created_at":"2026-07-05T11:12:48.400691+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05359","citing_title":"Bayesian inference of sparsity in stable vector autoregressive processes","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NFA4FSJHRQNKQUDDFM3CB7VA7U","json":"https://pith.science/pith/NFA4FSJHRQNKQUDDFM3CB7VA7U.json","graph_json":"https://pith.science/api/pith-number/NFA4FSJHRQNKQUDDFM3CB7VA7U/graph.json","events_json":"https://pith.science/api/pith-number/NFA4FSJHRQNKQUDDFM3CB7VA7U/events.json","paper":"https://pith.science/paper/NFA4FSJH"},"agent_actions":{"view_html":"https://pith.science/pith/NFA4FSJHRQNKQUDDFM3CB7VA7U","download_json":"https://pith.science/pith/NFA4FSJHRQNKQUDDFM3CB7VA7U.json","view_paper":"https://pith.science/paper/NFA4FSJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24400&json=true","fetch_graph":"https://pith.science/api/pith-number/NFA4FSJHRQNKQUDDFM3CB7VA7U/graph.json","fetch_events":"https://pith.science/api/pith-number/NFA4FSJHRQNKQUDDFM3CB7VA7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFA4FSJHRQNKQUDDFM3CB7VA7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFA4FSJHRQNKQUDDFM3CB7VA7U/action/storage_attestation","attest_author":"https://pith.science/pith/NFA4FSJHRQNKQUDDFM3CB7VA7U/action/author_attestation","sign_citation":"https://pith.science/pith/NFA4FSJHRQNKQUDDFM3CB7VA7U/action/citation_signature","submit_replication":"https://pith.science/pith/NFA4FSJHRQNKQUDDFM3CB7VA7U/action/replication_record"}},"created_at":"2026-07-05T11:12:48.400691+00:00","updated_at":"2026-07-05T11:12:48.400691+00:00"}