{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:N4BO6VF7G7VDIXMJHZSMNJBLVQ","short_pith_number":"pith:N4BO6VF7","canonical_record":{"source":{"id":"math/0409429","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2004-09-22T12:32:25Z","cross_cats_sorted":["cs.DM","math.CO","math.ST","stat.TH"],"title_canon_sha256":"c704341a1fb122a36f802407690f224440124e4ff8a845232f3823b89792b559","abstract_canon_sha256":"ea1a9c218b6e83876d637ebb5c66cebaeb9841ff80e1ecf8c8dd1b8a1f74ca66"},"schema_version":"1.0"},"canonical_sha256":"6f02ef54bf37ea345d893e64c6a42bac1ab50c132083ca7e56aa121be06a25ea","source":{"kind":"arxiv","id":"math/0409429","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0409429","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"math/0409429v1","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0409429","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"N4BO6VF7G7VD","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"N4BO6VF7G7VDIXMJ","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"N4BO6VF7","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:N4BO6VF7G7VDIXMJHZSMNJBLVQ","target":"record","payload":{"canonical_record":{"source":{"id":"math/0409429","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2004-09-22T12:32:25Z","cross_cats_sorted":["cs.DM","math.CO","math.ST","stat.TH"],"title_canon_sha256":"c704341a1fb122a36f802407690f224440124e4ff8a845232f3823b89792b559","abstract_canon_sha256":"ea1a9c218b6e83876d637ebb5c66cebaeb9841ff80e1ecf8c8dd1b8a1f74ca66"},"schema_version":"1.0"},"canonical_sha256":"6f02ef54bf37ea345d893e64c6a42bac1ab50c132083ca7e56aa121be06a25ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:05.021162Z","signature_b64":"prOp5LFxwAOnBXaaAjZ5AkO4PWxubgJGm6ruN5fRDzNBHxrqH2nPDcQGmglUYW+qlD2Okuh56XXaO1MtQI6qDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f02ef54bf37ea345d893e64c6a42bac1ab50c132083ca7e56aa121be06a25ea","last_reissued_at":"2026-05-18T04:14:05.020672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:05.020672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0409429","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-18T04:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7vFCXQDADrwlcV9C5+oscO5FGX3tHnfBP5zXxcTa8kAOJYAJHdXP8eO7H4Jeh/W83GLJlzSXh3VgWbqL+yAWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:11:10.438617Z"},"content_sha256":"5193728764601a45b676e3185e7402fdb3a62da9ef0630439eba01a9438d2867","schema_version":"1.0","event_id":"sha256:5193728764601a45b676e3185e7402fdb3a62da9ef0630439eba01a9438d2867"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:N4BO6VF7G7VDIXMJHZSMNJBLVQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding Fastest Mixing","license":"","headline":"","cross_cats":["cs.DM","math.CO","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"S. Roch","submitted_at":"2004-09-22T12:32:25Z","abstract_excerpt":"In a series of recent works, Boyd, Diaconis, and their co-authors have introduced a semidefinite programming approach for computing the fastest mixing Markov chain on a graph of allowed transitions, given a target stationary distribution. In this paper, we show that standard mixing-time analysis techniques--variational characterizations, conductance, canonical paths--can be used to give simple, nontrivial lower and upper bounds on the fastest mixing time. To test the applicability of this idea, we consider several detailed examples including the Glauber dynamics of the Ising model--and get sha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0409429","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-18T04:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Z6y+mb09SZ2mrJx8bwMtJb5EsHI6nobujqUdS8ubiYNIuIkPhVLwoxfezC+VLFZYCdTWkVJjGtv617g+1W8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:11:10.439278Z"},"content_sha256":"8571a9b0115922de0277217685322e359373c73970b79d5ef3db208b04c45477","schema_version":"1.0","event_id":"sha256:8571a9b0115922de0277217685322e359373c73970b79d5ef3db208b04c45477"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4BO6VF7G7VDIXMJHZSMNJBLVQ/bundle.json","state_url":"https://pith.science/pith/N4BO6VF7G7VDIXMJHZSMNJBLVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4BO6VF7G7VDIXMJHZSMNJBLVQ/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-05T21:11:10Z","links":{"resolver":"https://pith.science/pith/N4BO6VF7G7VDIXMJHZSMNJBLVQ","bundle":"https://pith.science/pith/N4BO6VF7G7VDIXMJHZSMNJBLVQ/bundle.json","state":"https://pith.science/pith/N4BO6VF7G7VDIXMJHZSMNJBLVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4BO6VF7G7VDIXMJHZSMNJBLVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:N4BO6VF7G7VDIXMJHZSMNJBLVQ","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":"ea1a9c218b6e83876d637ebb5c66cebaeb9841ff80e1ecf8c8dd1b8a1f74ca66","cross_cats_sorted":["cs.DM","math.CO","math.ST","stat.TH"],"license":"","primary_cat":"math.PR","submitted_at":"2004-09-22T12:32:25Z","title_canon_sha256":"c704341a1fb122a36f802407690f224440124e4ff8a845232f3823b89792b559"},"schema_version":"1.0","source":{"id":"math/0409429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0409429","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"math/0409429v1","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0409429","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"N4BO6VF7G7VD","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"N4BO6VF7G7VDIXMJ","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"N4BO6VF7","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:8571a9b0115922de0277217685322e359373c73970b79d5ef3db208b04c45477","target":"graph","created_at":"2026-05-18T04:14:05Z","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":"In a series of recent works, Boyd, Diaconis, and their co-authors have introduced a semidefinite programming approach for computing the fastest mixing Markov chain on a graph of allowed transitions, given a target stationary distribution. In this paper, we show that standard mixing-time analysis techniques--variational characterizations, conductance, canonical paths--can be used to give simple, nontrivial lower and upper bounds on the fastest mixing time. To test the applicability of this idea, we consider several detailed examples including the Glauber dynamics of the Ising model--and get sha","authors_text":"S. Roch","cross_cats":["cs.DM","math.CO","math.ST","stat.TH"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2004-09-22T12:32:25Z","title":"Bounding Fastest Mixing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0409429","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:5193728764601a45b676e3185e7402fdb3a62da9ef0630439eba01a9438d2867","target":"record","created_at":"2026-05-18T04:14:05Z","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":"ea1a9c218b6e83876d637ebb5c66cebaeb9841ff80e1ecf8c8dd1b8a1f74ca66","cross_cats_sorted":["cs.DM","math.CO","math.ST","stat.TH"],"license":"","primary_cat":"math.PR","submitted_at":"2004-09-22T12:32:25Z","title_canon_sha256":"c704341a1fb122a36f802407690f224440124e4ff8a845232f3823b89792b559"},"schema_version":"1.0","source":{"id":"math/0409429","kind":"arxiv","version":1}},"canonical_sha256":"6f02ef54bf37ea345d893e64c6a42bac1ab50c132083ca7e56aa121be06a25ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f02ef54bf37ea345d893e64c6a42bac1ab50c132083ca7e56aa121be06a25ea","first_computed_at":"2026-05-18T04:14:05.020672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:05.020672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"prOp5LFxwAOnBXaaAjZ5AkO4PWxubgJGm6ruN5fRDzNBHxrqH2nPDcQGmglUYW+qlD2Okuh56XXaO1MtQI6qDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:05.021162Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0409429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5193728764601a45b676e3185e7402fdb3a62da9ef0630439eba01a9438d2867","sha256:8571a9b0115922de0277217685322e359373c73970b79d5ef3db208b04c45477"],"state_sha256":"26b37b113769d5c67abe863af8c44c844cac8c82a36e43525fe21de59a7340b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdKgxysxnFCy0Ni6vBA9iuKEVn6cL+sKVjEosg9dm4oG584GrmhEocCdvBWfmX8KEzBfn8b3m4uMKEerWXm7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:11:10.443927Z","bundle_sha256":"87bcdd23f4225bbe79c6533e14cb15e1cf9e0d375878a41e73908fceaeec68a9"}}