{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EG5RSOY3BQPKSR55X3W5YGR5LO","short_pith_number":"pith:EG5RSOY3","canonical_record":{"source":{"id":"1710.08165","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T09:33:02Z","cross_cats_sorted":[],"title_canon_sha256":"f8a6596a7c2852bf884c9cda5d7dd428e4ddd05255870e4ce636b25ec76ed8f3","abstract_canon_sha256":"e9958daf65ef7289f628cee6a523fe2f3922e2231365a1c9c693777d395ac67a"},"schema_version":"1.0"},"canonical_sha256":"21bb193b1b0c1ea947bdbeeddc1a3d5b8aa90835a5a810f07f458c3ece20fb62","source":{"kind":"arxiv","id":"1710.08165","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08165","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08165v3","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08165","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"EG5RSOY3BQPK","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EG5RSOY3BQPKSR55","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EG5RSOY3","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EG5RSOY3BQPKSR55X3W5YGR5LO","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08165","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T09:33:02Z","cross_cats_sorted":[],"title_canon_sha256":"f8a6596a7c2852bf884c9cda5d7dd428e4ddd05255870e4ce636b25ec76ed8f3","abstract_canon_sha256":"e9958daf65ef7289f628cee6a523fe2f3922e2231365a1c9c693777d395ac67a"},"schema_version":"1.0"},"canonical_sha256":"21bb193b1b0c1ea947bdbeeddc1a3d5b8aa90835a5a810f07f458c3ece20fb62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.171162Z","signature_b64":"xdBxuA0j4vzrXrSHu2IAcmes5iqDCnBULQXopldwMnvy5uri+DppwWC/HPc8XIflQXAL97m04y6A6mNiXFaPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21bb193b1b0c1ea947bdbeeddc1a3d5b8aa90835a5a810f07f458c3ece20fb62","last_reissued_at":"2026-05-17T23:51:59.170798Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.170798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08165","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/hbwOUuTSYh4pvA+Hn09Qyvj2gsAfW4NhNsgQDm4iur7DHoObA3tOYK2i7N7Pjye04tsxq2q6xZX7cUjj4hAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:28:59.142919Z"},"content_sha256":"ef4d5368f19da7ee91433f4bf1c7f61d982f08f756e197e704fd4d7e1dbe938c","schema_version":"1.0","event_id":"sha256:ef4d5368f19da7ee91433f4bf1c7f61d982f08f756e197e704fd4d7e1dbe938c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EG5RSOY3BQPKSR55X3W5YGR5LO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast MCMC sampling algorithms on polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Bin Yu, Martin J. Wainwright, Raaz Dwivedi, Yuansi Chen","submitted_at":"2017-10-23T09:33:02Z","abstract_excerpt":"We propose and analyze two new MCMC sampling algorithms, the Vaidya walk and the John walk, for generating samples from the uniform distribution over a polytope. Both random walks are sampling algorithms derived from interior point methods. The former is based on volumetric-logarithmic barrier introduced by Vaidya whereas the latter uses John's ellipsoids. We show that the Vaidya walk mixes in significantly fewer steps than the logarithmic-barrier based Dikin walk studied in past work. For a polytope in $\\mathbb{R}^d$ defined by $n >d$ linear constraints, we show that the mixing time from a wa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08165","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mCcGFT5AGx+QhIUojvu6ub0peSyFpvI3tjK52SdlFmEqqiDeNP1wp/I10OrcN20yfLW+7kuwwA/qIezpaInHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:28:59.143285Z"},"content_sha256":"42e3846c4e95c6d386f6b5c70d153d8b8100923db28bb255f8a46cce3a2272c7","schema_version":"1.0","event_id":"sha256:42e3846c4e95c6d386f6b5c70d153d8b8100923db28bb255f8a46cce3a2272c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EG5RSOY3BQPKSR55X3W5YGR5LO/bundle.json","state_url":"https://pith.science/pith/EG5RSOY3BQPKSR55X3W5YGR5LO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EG5RSOY3BQPKSR55X3W5YGR5LO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T16:28:59Z","links":{"resolver":"https://pith.science/pith/EG5RSOY3BQPKSR55X3W5YGR5LO","bundle":"https://pith.science/pith/EG5RSOY3BQPKSR55X3W5YGR5LO/bundle.json","state":"https://pith.science/pith/EG5RSOY3BQPKSR55X3W5YGR5LO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EG5RSOY3BQPKSR55X3W5YGR5LO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EG5RSOY3BQPKSR55X3W5YGR5LO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e9958daf65ef7289f628cee6a523fe2f3922e2231365a1c9c693777d395ac67a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T09:33:02Z","title_canon_sha256":"f8a6596a7c2852bf884c9cda5d7dd428e4ddd05255870e4ce636b25ec76ed8f3"},"schema_version":"1.0","source":{"id":"1710.08165","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08165","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08165v3","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08165","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"EG5RSOY3BQPK","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EG5RSOY3BQPKSR55","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EG5RSOY3","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:42e3846c4e95c6d386f6b5c70d153d8b8100923db28bb255f8a46cce3a2272c7","target":"graph","created_at":"2026-05-17T23:51:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose and analyze two new MCMC sampling algorithms, the Vaidya walk and the John walk, for generating samples from the uniform distribution over a polytope. Both random walks are sampling algorithms derived from interior point methods. The former is based on volumetric-logarithmic barrier introduced by Vaidya whereas the latter uses John's ellipsoids. We show that the Vaidya walk mixes in significantly fewer steps than the logarithmic-barrier based Dikin walk studied in past work. For a polytope in $\\mathbb{R}^d$ defined by $n >d$ linear constraints, we show that the mixing time from a wa","authors_text":"Bin Yu, Martin J. Wainwright, Raaz Dwivedi, Yuansi Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T09:33:02Z","title":"Fast MCMC sampling algorithms on polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08165","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ef4d5368f19da7ee91433f4bf1c7f61d982f08f756e197e704fd4d7e1dbe938c","target":"record","created_at":"2026-05-17T23:51:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e9958daf65ef7289f628cee6a523fe2f3922e2231365a1c9c693777d395ac67a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T09:33:02Z","title_canon_sha256":"f8a6596a7c2852bf884c9cda5d7dd428e4ddd05255870e4ce636b25ec76ed8f3"},"schema_version":"1.0","source":{"id":"1710.08165","kind":"arxiv","version":3}},"canonical_sha256":"21bb193b1b0c1ea947bdbeeddc1a3d5b8aa90835a5a810f07f458c3ece20fb62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21bb193b1b0c1ea947bdbeeddc1a3d5b8aa90835a5a810f07f458c3ece20fb62","first_computed_at":"2026-05-17T23:51:59.170798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:59.170798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xdBxuA0j4vzrXrSHu2IAcmes5iqDCnBULQXopldwMnvy5uri+DppwWC/HPc8XIflQXAL97m04y6A6mNiXFaPAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:59.171162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08165","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef4d5368f19da7ee91433f4bf1c7f61d982f08f756e197e704fd4d7e1dbe938c","sha256:42e3846c4e95c6d386f6b5c70d153d8b8100923db28bb255f8a46cce3a2272c7"],"state_sha256":"7009421e1969e8ec99ada5c6754b9320174ca844ea5e3a5163606ff0ccfa439c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6TWf++dFG2hsVS+tg7L05ZK3lC3O0Y/spy89vBhkMVP20FoRKggp6aqc5H819dSAq+29dfv2y7gu4LuotQpsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:28:59.146520Z","bundle_sha256":"1efe841a6cf3e0feee0ce980ee2273531ae8964d4c6ab6fd1cfe123218c7c53d"}}