{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4HB2PFYTI6HSMCMTXD7APRN3TI","short_pith_number":"pith:4HB2PFYT","schema_version":"1.0","canonical_sha256":"e1c3a79713478f260993b8fe07c5bb9a2fa2f952a31e3da4c81ac6fc420e9bfe","source":{"kind":"arxiv","id":"2503.01707","version":2},"attestation_state":"computed","paper":{"title":"Metropolis Adjusted Microcanonical Hamiltonian Monte Carlo","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Jakob Robnik, Reuben Cohn-Gordon, Uro\\v{s} Seljak","submitted_at":"2025-03-03T16:20:19Z","abstract_excerpt":"Sampling from high dimensional distributions is a computational bottleneck in many scientific applications. Hamiltonian Monte Carlo (HMC), and in particular the No-U-Turn Sampler (NUTS), are widely used, yet they struggle on problems with a very large number of parameters or a complicated geometry. Microcanonical Langevin Monte Carlo (MCLMC) has been recently proposed as an alternative which shows striking gains in efficiency over NUTS, especially for high-dimensional problems. However, it produces biased samples, with a bias that is hard to control in general. We introduce the Metropolis-Adju"},"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":"2503.01707","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2025-03-03T16:20:19Z","cross_cats_sorted":[],"title_canon_sha256":"24a8824ca65abeb476f440d587705318da978274bcadc10b8aac3e7ba250c18a","abstract_canon_sha256":"b2526e7108740e9121d7ffc46404348a49769fe45055f74273b0e9e53fc28d3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:46.750049Z","signature_b64":"b9xzgNJ8n76+eNv5dRMonha9+ota4PycWnL0oISqvzDAjmnnVGXOsmzBULagHb8OepD+s1gn8F84KWyp5DRZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1c3a79713478f260993b8fe07c5bb9a2fa2f952a31e3da4c81ac6fc420e9bfe","last_reissued_at":"2026-07-05T11:04:46.749591Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:46.749591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metropolis Adjusted Microcanonical Hamiltonian Monte Carlo","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Jakob Robnik, Reuben Cohn-Gordon, Uro\\v{s} Seljak","submitted_at":"2025-03-03T16:20:19Z","abstract_excerpt":"Sampling from high dimensional distributions is a computational bottleneck in many scientific applications. Hamiltonian Monte Carlo (HMC), and in particular the No-U-Turn Sampler (NUTS), are widely used, yet they struggle on problems with a very large number of parameters or a complicated geometry. Microcanonical Langevin Monte Carlo (MCLMC) has been recently proposed as an alternative which shows striking gains in efficiency over NUTS, especially for high-dimensional problems. However, it produces biased samples, with a bias that is hard to control in general. We introduce the Metropolis-Adju"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01707","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/2503.01707/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":"2503.01707","created_at":"2026-07-05T11:04:46.749655+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.01707v2","created_at":"2026-07-05T11:04:46.749655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01707","created_at":"2026-07-05T11:04:46.749655+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HB2PFYTI6HS","created_at":"2026-07-05T11:04:46.749655+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HB2PFYTI6HSMCMT","created_at":"2026-07-05T11:04:46.749655+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HB2PFYT","created_at":"2026-07-05T11:04:46.749655+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.25824","citing_title":"The Ray Tracing Sampler: Bayesian Sampling of Neural Networks for Everyone","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4HB2PFYTI6HSMCMTXD7APRN3TI","json":"https://pith.science/pith/4HB2PFYTI6HSMCMTXD7APRN3TI.json","graph_json":"https://pith.science/api/pith-number/4HB2PFYTI6HSMCMTXD7APRN3TI/graph.json","events_json":"https://pith.science/api/pith-number/4HB2PFYTI6HSMCMTXD7APRN3TI/events.json","paper":"https://pith.science/paper/4HB2PFYT"},"agent_actions":{"view_html":"https://pith.science/pith/4HB2PFYTI6HSMCMTXD7APRN3TI","download_json":"https://pith.science/pith/4HB2PFYTI6HSMCMTXD7APRN3TI.json","view_paper":"https://pith.science/paper/4HB2PFYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.01707&json=true","fetch_graph":"https://pith.science/api/pith-number/4HB2PFYTI6HSMCMTXD7APRN3TI/graph.json","fetch_events":"https://pith.science/api/pith-number/4HB2PFYTI6HSMCMTXD7APRN3TI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HB2PFYTI6HSMCMTXD7APRN3TI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HB2PFYTI6HSMCMTXD7APRN3TI/action/storage_attestation","attest_author":"https://pith.science/pith/4HB2PFYTI6HSMCMTXD7APRN3TI/action/author_attestation","sign_citation":"https://pith.science/pith/4HB2PFYTI6HSMCMTXD7APRN3TI/action/citation_signature","submit_replication":"https://pith.science/pith/4HB2PFYTI6HSMCMTXD7APRN3TI/action/replication_record"}},"created_at":"2026-07-05T11:04:46.749655+00:00","updated_at":"2026-07-05T11:04:46.749655+00:00"}