{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:26DDC2OT4D2QUBDGRSLKMWLHF5","short_pith_number":"pith:26DDC2OT","schema_version":"1.0","canonical_sha256":"d7863169d3e0f50a04668c96a659672f5ae7a7579be738f9b870585dbac358af","source":{"kind":"arxiv","id":"2002.01184","version":1},"attestation_state":"computed","paper":{"title":"tfp.mcmc: Modern Markov Chain Monte Carlo Tools Built for Modern Hardware","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL","stat.ML"],"primary_cat":"stat.CO","authors_text":"Ashish Saxena, Christopher Suter, Cyril Chimisov, Dave Moore, Ian Langmore, Joshua V. Dillon, Junpeng Lao, Matthew D. Hoffman, Pavel Sountsov, Rif A. Saurous","submitted_at":"2020-02-04T09:27:26Z","abstract_excerpt":"Markov chain Monte Carlo (MCMC) is widely regarded as one of the most important algorithms of the 20th century. Its guarantees of asymptotic convergence, stability, and estimator-variance bounds using only unnormalized probability functions make it indispensable to probabilistic programming. In this paper, we introduce the TensorFlow Probability MCMC toolkit, and discuss some of the considerations that motivated its design."},"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":"2002.01184","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2020-02-04T09:27:26Z","cross_cats_sorted":["cs.PL","stat.ML"],"title_canon_sha256":"e3ac5332e105e5b88526e400101845b01bb6e2def53e0d92fd29c8e45ac56023","abstract_canon_sha256":"f46b1cf23c68a993567a8f19fb152f314ff92bd0003da36488c260bf8641fbcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:38:15.746387Z","signature_b64":"A2flP4OaT0Z7eEkQXRv5LK3vBSMsPk/J4suNHh6m8Hhnx73FEF4LfKP+wcE+JtCrWotuhpt3wwU+tXslrwJFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7863169d3e0f50a04668c96a659672f5ae7a7579be738f9b870585dbac358af","last_reissued_at":"2026-07-05T00:38:15.745859Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:38:15.745859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"tfp.mcmc: Modern Markov Chain Monte Carlo Tools Built for Modern Hardware","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL","stat.ML"],"primary_cat":"stat.CO","authors_text":"Ashish Saxena, Christopher Suter, Cyril Chimisov, Dave Moore, Ian Langmore, Joshua V. Dillon, Junpeng Lao, Matthew D. Hoffman, Pavel Sountsov, Rif A. Saurous","submitted_at":"2020-02-04T09:27:26Z","abstract_excerpt":"Markov chain Monte Carlo (MCMC) is widely regarded as one of the most important algorithms of the 20th century. Its guarantees of asymptotic convergence, stability, and estimator-variance bounds using only unnormalized probability functions make it indispensable to probabilistic programming. In this paper, we introduce the TensorFlow Probability MCMC toolkit, and discuss some of the considerations that motivated its design."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.01184","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/2002.01184/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":"2002.01184","created_at":"2026-07-05T00:38:15.745921+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.01184v1","created_at":"2026-07-05T00:38:15.745921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.01184","created_at":"2026-07-05T00:38:15.745921+00:00"},{"alias_kind":"pith_short_12","alias_value":"26DDC2OT4D2Q","created_at":"2026-07-05T00:38:15.745921+00:00"},{"alias_kind":"pith_short_16","alias_value":"26DDC2OT4D2QUBDG","created_at":"2026-07-05T00:38:15.745921+00:00"},{"alias_kind":"pith_short_8","alias_value":"26DDC2OT","created_at":"2026-07-05T00:38:15.745921+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10914","citing_title":"gemlib.mcmc: composable kernels for Metropolis-within-Gibbs sampling schemes","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/26DDC2OT4D2QUBDGRSLKMWLHF5","json":"https://pith.science/pith/26DDC2OT4D2QUBDGRSLKMWLHF5.json","graph_json":"https://pith.science/api/pith-number/26DDC2OT4D2QUBDGRSLKMWLHF5/graph.json","events_json":"https://pith.science/api/pith-number/26DDC2OT4D2QUBDGRSLKMWLHF5/events.json","paper":"https://pith.science/paper/26DDC2OT"},"agent_actions":{"view_html":"https://pith.science/pith/26DDC2OT4D2QUBDGRSLKMWLHF5","download_json":"https://pith.science/pith/26DDC2OT4D2QUBDGRSLKMWLHF5.json","view_paper":"https://pith.science/paper/26DDC2OT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.01184&json=true","fetch_graph":"https://pith.science/api/pith-number/26DDC2OT4D2QUBDGRSLKMWLHF5/graph.json","fetch_events":"https://pith.science/api/pith-number/26DDC2OT4D2QUBDGRSLKMWLHF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26DDC2OT4D2QUBDGRSLKMWLHF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26DDC2OT4D2QUBDGRSLKMWLHF5/action/storage_attestation","attest_author":"https://pith.science/pith/26DDC2OT4D2QUBDGRSLKMWLHF5/action/author_attestation","sign_citation":"https://pith.science/pith/26DDC2OT4D2QUBDGRSLKMWLHF5/action/citation_signature","submit_replication":"https://pith.science/pith/26DDC2OT4D2QUBDGRSLKMWLHF5/action/replication_record"}},"created_at":"2026-07-05T00:38:15.745921+00:00","updated_at":"2026-07-05T00:38:15.745921+00:00"}