{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XKTTS3FHVNIBYDY7WBNE25ILN4","short_pith_number":"pith:XKTTS3FH","canonical_record":{"source":{"id":"1605.06420","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-05-20T16:17:22Z","cross_cats_sorted":["math.PR","stat.CO","stat.ML","stat.TH"],"title_canon_sha256":"aace54ff0dbdf12508e1e0a340fe2e6736d799c6f345eba44d9394b8ae56f3c0","abstract_canon_sha256":"98888ab8613882331aa3a36916243701c1f5cb7b1580c63a78992de7a84fd4d1"},"schema_version":"1.0"},"canonical_sha256":"baa7396ca7ab501c0f1fb05a4d750b6f01d44d86f11e84e275445acb427f99bc","source":{"kind":"arxiv","id":"1605.06420","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06420","created_at":"2026-05-18T00:36:24Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06420v4","created_at":"2026-05-18T00:36:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06420","created_at":"2026-05-18T00:36:24Z"},{"alias_kind":"pith_short_12","alias_value":"XKTTS3FHVNIB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XKTTS3FHVNIBYDY7","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XKTTS3FH","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XKTTS3FHVNIBYDY7WBNE25ILN4","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06420","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-05-20T16:17:22Z","cross_cats_sorted":["math.PR","stat.CO","stat.ML","stat.TH"],"title_canon_sha256":"aace54ff0dbdf12508e1e0a340fe2e6736d799c6f345eba44d9394b8ae56f3c0","abstract_canon_sha256":"98888ab8613882331aa3a36916243701c1f5cb7b1580c63a78992de7a84fd4d1"},"schema_version":"1.0"},"canonical_sha256":"baa7396ca7ab501c0f1fb05a4d750b6f01d44d86f11e84e275445acb427f99bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:24.758577Z","signature_b64":"HdAkTvHReR8bEMxHxRS664RJv3oZNbQOQfdMbaf5VGdcD3Wwe8kbTxpEgtuidoBeAh0Gy1z6Ml6eqNF772ELCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baa7396ca7ab501c0f1fb05a4d750b6f01d44d86f11e84e275445acb427f99bc","last_reissued_at":"2026-05-18T00:36:24.757844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:24.757844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06420","source_version":4,"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-18T00:36:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LhXGPXANwByV/mQbEvsfWbsF3LUxiKIpQ/6ozGvz3WWeSPU4W8sRT9NNkhRKEr5+jnXWRbTbTLOmNsVYMolXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:47:10.287988Z"},"content_sha256":"fd49f93531987731fcce1469c38f5a0aca8e09feadc7ac2acd37f293cf3e3250","schema_version":"1.0","event_id":"sha256:fd49f93531987731fcce1469c38f5a0aca8e09feadc7ac2acd37f293cf3e3250"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XKTTS3FHVNIBYDY7WBNE25ILN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantifying the accuracy of approximate diffusions and Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.CO","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"James Zou, Jonathan H. Huggins","submitted_at":"2016-05-20T16:17:22Z","abstract_excerpt":"Markov chains and diffusion processes are indispensable tools in machine learning and statistics that are used for inference, sampling, and modeling. With the growth of large-scale datasets, the computational cost associated with simulating these stochastic processes can be considerable, and many algorithms have been proposed to approximate the underlying Markov chain or diffusion. A fundamental question is how the computational savings trade off against the statistical error incurred due to approximations. This paper develops general results that address this question. We bound the Wasserstei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06420","kind":"arxiv","version":4},"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-18T00:36:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZ8BRSGyk09yV6AHcb39ymG2uDPWe+YPgjcWtU+zTJ6g5CI9XDujD6bJZ/G/2ZLGMrQP81o/WAb/cDUYdqNjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:47:10.288366Z"},"content_sha256":"c5c983946f35981fb31d37be879b6df688e4d55f5178654ac0f80e31b7487c3c","schema_version":"1.0","event_id":"sha256:c5c983946f35981fb31d37be879b6df688e4d55f5178654ac0f80e31b7487c3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XKTTS3FHVNIBYDY7WBNE25ILN4/bundle.json","state_url":"https://pith.science/pith/XKTTS3FHVNIBYDY7WBNE25ILN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XKTTS3FHVNIBYDY7WBNE25ILN4/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-06-12T08:47:10Z","links":{"resolver":"https://pith.science/pith/XKTTS3FHVNIBYDY7WBNE25ILN4","bundle":"https://pith.science/pith/XKTTS3FHVNIBYDY7WBNE25ILN4/bundle.json","state":"https://pith.science/pith/XKTTS3FHVNIBYDY7WBNE25ILN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XKTTS3FHVNIBYDY7WBNE25ILN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XKTTS3FHVNIBYDY7WBNE25ILN4","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":"98888ab8613882331aa3a36916243701c1f5cb7b1580c63a78992de7a84fd4d1","cross_cats_sorted":["math.PR","stat.CO","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-05-20T16:17:22Z","title_canon_sha256":"aace54ff0dbdf12508e1e0a340fe2e6736d799c6f345eba44d9394b8ae56f3c0"},"schema_version":"1.0","source":{"id":"1605.06420","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06420","created_at":"2026-05-18T00:36:24Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06420v4","created_at":"2026-05-18T00:36:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06420","created_at":"2026-05-18T00:36:24Z"},{"alias_kind":"pith_short_12","alias_value":"XKTTS3FHVNIB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XKTTS3FHVNIBYDY7","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XKTTS3FH","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:c5c983946f35981fb31d37be879b6df688e4d55f5178654ac0f80e31b7487c3c","target":"graph","created_at":"2026-05-18T00:36:24Z","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":"Markov chains and diffusion processes are indispensable tools in machine learning and statistics that are used for inference, sampling, and modeling. With the growth of large-scale datasets, the computational cost associated with simulating these stochastic processes can be considerable, and many algorithms have been proposed to approximate the underlying Markov chain or diffusion. A fundamental question is how the computational savings trade off against the statistical error incurred due to approximations. This paper develops general results that address this question. We bound the Wasserstei","authors_text":"James Zou, Jonathan H. Huggins","cross_cats":["math.PR","stat.CO","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-05-20T16:17:22Z","title":"Quantifying the accuracy of approximate diffusions and Markov chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06420","kind":"arxiv","version":4},"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:fd49f93531987731fcce1469c38f5a0aca8e09feadc7ac2acd37f293cf3e3250","target":"record","created_at":"2026-05-18T00:36:24Z","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":"98888ab8613882331aa3a36916243701c1f5cb7b1580c63a78992de7a84fd4d1","cross_cats_sorted":["math.PR","stat.CO","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-05-20T16:17:22Z","title_canon_sha256":"aace54ff0dbdf12508e1e0a340fe2e6736d799c6f345eba44d9394b8ae56f3c0"},"schema_version":"1.0","source":{"id":"1605.06420","kind":"arxiv","version":4}},"canonical_sha256":"baa7396ca7ab501c0f1fb05a4d750b6f01d44d86f11e84e275445acb427f99bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baa7396ca7ab501c0f1fb05a4d750b6f01d44d86f11e84e275445acb427f99bc","first_computed_at":"2026-05-18T00:36:24.757844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:24.757844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HdAkTvHReR8bEMxHxRS664RJv3oZNbQOQfdMbaf5VGdcD3Wwe8kbTxpEgtuidoBeAh0Gy1z6Ml6eqNF772ELCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:24.758577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06420","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd49f93531987731fcce1469c38f5a0aca8e09feadc7ac2acd37f293cf3e3250","sha256:c5c983946f35981fb31d37be879b6df688e4d55f5178654ac0f80e31b7487c3c"],"state_sha256":"ab0789a1738816a039120564d34d3bd0143337ce58c2d45a87c54baf3f74a8de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xsLNccjag8b/33LK9a6Tieu/m1Dfnyh6AEQvo8sy+LtZEMGLdXASuESgKiW2S9MDkG7dIxbaxH3huN+yLCOJAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T08:47:10.290356Z","bundle_sha256":"5a5ad707f9e2ec1617bd8c4b8838618a9fc4af84b8845b143f2088f3f9016987"}}