{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C226DGF3ES4IORSW6A3HV36QG2","short_pith_number":"pith:C226DGF3","canonical_record":{"source":{"id":"1506.08667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-05-26T08:21:30Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"0bdba13f1a462900ab866c9ece0d2777c14b88c58e9f3f9d2d77ee60b538ea87","abstract_canon_sha256":"e29b50d39c8ea55cd4419db9be2f903f8840e5ffa117e9a13f6ed5566daf3f6e"},"schema_version":"1.0"},"canonical_sha256":"16b5e198bb24b8874656f0367aefd036b2a6ed01462a30422a39471207acffed","source":{"kind":"arxiv","id":"1506.08667","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08667","created_at":"2026-05-18T01:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08667v1","created_at":"2026-05-18T01:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08667","created_at":"2026-05-18T01:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"C226DGF3ES4I","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C226DGF3ES4IORSW","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C226DGF3","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C226DGF3ES4IORSW6A3HV36QG2","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-05-26T08:21:30Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"0bdba13f1a462900ab866c9ece0d2777c14b88c58e9f3f9d2d77ee60b538ea87","abstract_canon_sha256":"e29b50d39c8ea55cd4419db9be2f903f8840e5ffa117e9a13f6ed5566daf3f6e"},"schema_version":"1.0"},"canonical_sha256":"16b5e198bb24b8874656f0367aefd036b2a6ed01462a30422a39471207acffed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:43.677624Z","signature_b64":"GeQIQXIkeaN/hmjTzcyxlVgOVZyTYWCf57XZsawBXIijUtNNUkhO/Mg9f0Dx2sAQ00NR8KKVmHVo8QGGdpOMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16b5e198bb24b8874656f0367aefd036b2a6ed01462a30422a39471207acffed","last_reissued_at":"2026-05-18T01:37:43.677067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:43.677067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08667","source_version":1,"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-18T01:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dciP9rlkicJDvKnSn9hMj/GCE7qBE7jjjCMWV1FuZA4H9ToBtRxbDZEQvPs52bNlacPtWc7ny1NQAHDoxxLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:03:55.482188Z"},"content_sha256":"e9060347222d069e7c5be55190f247d716760038a36b8eec439a264aaa1c6e11","schema_version":"1.0","event_id":"sha256:e9060347222d069e7c5be55190f247d716760038a36b8eec439a264aaa1c6e11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C226DGF3ES4IORSW6A3HV36QG2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Kolmogorov-Sinai entropy vs minimum mixing time in Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"cond-mat.stat-mech","authors_text":"Berengere Dubrulle, Davide Faranda, Didier Paillard, Martin Mihelich, Quentin Kral","submitted_at":"2015-05-26T08:21:30Z","abstract_excerpt":"Many modern techniques employed in physics, such a computation of path integrals, rely on random walks on graphs that can be represented as Markov chains. Traditionally, estimates of running times of such sampling algorithms are computed using the number of steps in the chain needed to reach the stationary distribution. This quantity is generally defined as mixing time and is often difficult to compute. In this paper, we suggest an alternative estimate based on the Kolmogorov-Sinai entropy, by establishing a link between the maximization of KSE and the minimization of the mixing time. Since KS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08667","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":""},"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-18T01:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SEAwXL2r63cv7OExL2bFQwQCSidN0sKHMPHsa6alzjcFxLTuTJetGT/4xwxd/PEnTvcIaH+KyYYpV+uzIltuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:03:55.482845Z"},"content_sha256":"5eb4b5db5ecf5f8f1f82ad3f36e2dfbbb5c976a0666285cd72b872062cbe6517","schema_version":"1.0","event_id":"sha256:5eb4b5db5ecf5f8f1f82ad3f36e2dfbbb5c976a0666285cd72b872062cbe6517"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C226DGF3ES4IORSW6A3HV36QG2/bundle.json","state_url":"https://pith.science/pith/C226DGF3ES4IORSW6A3HV36QG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C226DGF3ES4IORSW6A3HV36QG2/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-29T21:03:55Z","links":{"resolver":"https://pith.science/pith/C226DGF3ES4IORSW6A3HV36QG2","bundle":"https://pith.science/pith/C226DGF3ES4IORSW6A3HV36QG2/bundle.json","state":"https://pith.science/pith/C226DGF3ES4IORSW6A3HV36QG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C226DGF3ES4IORSW6A3HV36QG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C226DGF3ES4IORSW6A3HV36QG2","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":"e29b50d39c8ea55cd4419db9be2f903f8840e5ffa117e9a13f6ed5566daf3f6e","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-05-26T08:21:30Z","title_canon_sha256":"0bdba13f1a462900ab866c9ece0d2777c14b88c58e9f3f9d2d77ee60b538ea87"},"schema_version":"1.0","source":{"id":"1506.08667","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08667","created_at":"2026-05-18T01:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08667v1","created_at":"2026-05-18T01:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08667","created_at":"2026-05-18T01:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"C226DGF3ES4I","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C226DGF3ES4IORSW","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C226DGF3","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:5eb4b5db5ecf5f8f1f82ad3f36e2dfbbb5c976a0666285cd72b872062cbe6517","target":"graph","created_at":"2026-05-18T01:37:43Z","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":"Many modern techniques employed in physics, such a computation of path integrals, rely on random walks on graphs that can be represented as Markov chains. Traditionally, estimates of running times of such sampling algorithms are computed using the number of steps in the chain needed to reach the stationary distribution. This quantity is generally defined as mixing time and is often difficult to compute. In this paper, we suggest an alternative estimate based on the Kolmogorov-Sinai entropy, by establishing a link between the maximization of KSE and the minimization of the mixing time. Since KS","authors_text":"Berengere Dubrulle, Davide Faranda, Didier Paillard, Martin Mihelich, Quentin Kral","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-05-26T08:21:30Z","title":"Maximum Kolmogorov-Sinai entropy vs minimum mixing time in Markov chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08667","kind":"arxiv","version":1},"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:e9060347222d069e7c5be55190f247d716760038a36b8eec439a264aaa1c6e11","target":"record","created_at":"2026-05-18T01:37:43Z","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":"e29b50d39c8ea55cd4419db9be2f903f8840e5ffa117e9a13f6ed5566daf3f6e","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-05-26T08:21:30Z","title_canon_sha256":"0bdba13f1a462900ab866c9ece0d2777c14b88c58e9f3f9d2d77ee60b538ea87"},"schema_version":"1.0","source":{"id":"1506.08667","kind":"arxiv","version":1}},"canonical_sha256":"16b5e198bb24b8874656f0367aefd036b2a6ed01462a30422a39471207acffed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16b5e198bb24b8874656f0367aefd036b2a6ed01462a30422a39471207acffed","first_computed_at":"2026-05-18T01:37:43.677067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:43.677067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GeQIQXIkeaN/hmjTzcyxlVgOVZyTYWCf57XZsawBXIijUtNNUkhO/Mg9f0Dx2sAQ00NR8KKVmHVo8QGGdpOMAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:43.677624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08667","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9060347222d069e7c5be55190f247d716760038a36b8eec439a264aaa1c6e11","sha256:5eb4b5db5ecf5f8f1f82ad3f36e2dfbbb5c976a0666285cd72b872062cbe6517"],"state_sha256":"c839db6af5c66e9c38b8855cfda6d79973ed991fd56144eccb5deac946ce10dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VCK29wcLW27Y8cRx9DHFEFn/zHmIGvEZKMsUqsGIp4SGRcAQeSjJe/89msGodpVz5PVXVmMF0mMU/1Zvtx8dBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:03:55.486199Z","bundle_sha256":"0dcbe2d59929d77d0967d774f5cade58286cb23328f9ba6e1ba5eae8493952f0"}}