{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:E7GVIW5KPO3ACWBVDAVMNR5CAX","short_pith_number":"pith:E7GVIW5K","canonical_record":{"source":{"id":"0908.2038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-08-14T10:56:40Z","cross_cats_sorted":[],"title_canon_sha256":"97d9669c5c1fccfe39cf9be3d085e32a3d26f2d204f4e2b824c9df73bd725e03","abstract_canon_sha256":"b382033e4f7fd539bc0d04299aed3731011e0afb576daf9f58ebcfcbcc69bcda"},"schema_version":"1.0"},"canonical_sha256":"27cd545baa7bb6015835182ac6c7a205ea39dffb4b4002225081e02980d291c6","source":{"kind":"arxiv","id":"0908.2038","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.2038","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"arxiv_version","alias_value":"0908.2038v2","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.2038","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"pith_short_12","alias_value":"E7GVIW5KPO3A","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"E7GVIW5KPO3ACWBV","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"E7GVIW5K","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:E7GVIW5KPO3ACWBVDAVMNR5CAX","target":"record","payload":{"canonical_record":{"source":{"id":"0908.2038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-08-14T10:56:40Z","cross_cats_sorted":[],"title_canon_sha256":"97d9669c5c1fccfe39cf9be3d085e32a3d26f2d204f4e2b824c9df73bd725e03","abstract_canon_sha256":"b382033e4f7fd539bc0d04299aed3731011e0afb576daf9f58ebcfcbcc69bcda"},"schema_version":"1.0"},"canonical_sha256":"27cd545baa7bb6015835182ac6c7a205ea39dffb4b4002225081e02980d291c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:36.277898Z","signature_b64":"ld+18x2CsfPtXVO3uoo9kOI+sMQ9rzUwBYqrhXmE9UP/mKtvFpOVU5O1aIeQHNWmhYdP5zpNNJrFmQvrljk6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27cd545baa7bb6015835182ac6c7a205ea39dffb4b4002225081e02980d291c6","last_reissued_at":"2026-05-18T02:57:36.277294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:36.277294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.2038","source_version":2,"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-18T02:57:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWWiZ4Z5YkIanb+TDd2wyDBlVKp/jFJnKR2PNnlgDF83/dSbRqdAW//B7fz8ryIhDFiJEC+vnY9+SMU4pRmyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:01:31.138794Z"},"content_sha256":"889d8bc5c6a400ff55a378079d4196d276994b47772d6e539c215e382b892096","schema_version":"1.0","event_id":"sha256:889d8bc5c6a400ff55a378079d4196d276994b47772d6e539c215e382b892096"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:E7GVIW5KPO3ACWBVDAVMNR5CAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal co-adapted coupling for a random walk on the hyper-complete-graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Stephen B. Connor","submitted_at":"2009-08-14T10:56:40Z","abstract_excerpt":"The problem of constructing an optimal co-adapted coupling for a pair of symmetric random walks on $Z_2^d$ was considered by Connor and Jacka (2008), and the existence of a coupling which is stochastically fastest in the class of all such co-adapted couplings was demonstrated. In this paper we show how to generalise this construction to an optimal co-adapted coupling for the continuous-time symmetric random walk on $K_n^d$, where $K_n$ is the complete graph with $n$ vertices. Moreover, we show that although this coupling is not maximal for any $n$ (i.e. it does not achieve equality in the coup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.2038","kind":"arxiv","version":2},"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-18T02:57:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tIqNAGQ9scXp+4Yzr/5O8n70pdeDIR+OLRY82RoCIJvuQgp/pjy7UN/rKBqJwBfRpzkeT6WyERRkAZzP5JLiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:01:31.139145Z"},"content_sha256":"f6b9614867e24d854a51919adada9f8bf576acefaa0ac77a96ded48c3a3b72c8","schema_version":"1.0","event_id":"sha256:f6b9614867e24d854a51919adada9f8bf576acefaa0ac77a96ded48c3a3b72c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX/bundle.json","state_url":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX/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-23T00:01:31Z","links":{"resolver":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX","bundle":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX/bundle.json","state":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:E7GVIW5KPO3ACWBVDAVMNR5CAX","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":"b382033e4f7fd539bc0d04299aed3731011e0afb576daf9f58ebcfcbcc69bcda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-08-14T10:56:40Z","title_canon_sha256":"97d9669c5c1fccfe39cf9be3d085e32a3d26f2d204f4e2b824c9df73bd725e03"},"schema_version":"1.0","source":{"id":"0908.2038","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.2038","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"arxiv_version","alias_value":"0908.2038v2","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.2038","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"pith_short_12","alias_value":"E7GVIW5KPO3A","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"E7GVIW5KPO3ACWBV","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"E7GVIW5K","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:f6b9614867e24d854a51919adada9f8bf576acefaa0ac77a96ded48c3a3b72c8","target":"graph","created_at":"2026-05-18T02:57:36Z","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":"The problem of constructing an optimal co-adapted coupling for a pair of symmetric random walks on $Z_2^d$ was considered by Connor and Jacka (2008), and the existence of a coupling which is stochastically fastest in the class of all such co-adapted couplings was demonstrated. In this paper we show how to generalise this construction to an optimal co-adapted coupling for the continuous-time symmetric random walk on $K_n^d$, where $K_n$ is the complete graph with $n$ vertices. Moreover, we show that although this coupling is not maximal for any $n$ (i.e. it does not achieve equality in the coup","authors_text":"Stephen B. Connor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-08-14T10:56:40Z","title":"Optimal co-adapted coupling for a random walk on the hyper-complete-graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.2038","kind":"arxiv","version":2},"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:889d8bc5c6a400ff55a378079d4196d276994b47772d6e539c215e382b892096","target":"record","created_at":"2026-05-18T02:57:36Z","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":"b382033e4f7fd539bc0d04299aed3731011e0afb576daf9f58ebcfcbcc69bcda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-08-14T10:56:40Z","title_canon_sha256":"97d9669c5c1fccfe39cf9be3d085e32a3d26f2d204f4e2b824c9df73bd725e03"},"schema_version":"1.0","source":{"id":"0908.2038","kind":"arxiv","version":2}},"canonical_sha256":"27cd545baa7bb6015835182ac6c7a205ea39dffb4b4002225081e02980d291c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27cd545baa7bb6015835182ac6c7a205ea39dffb4b4002225081e02980d291c6","first_computed_at":"2026-05-18T02:57:36.277294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:36.277294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ld+18x2CsfPtXVO3uoo9kOI+sMQ9rzUwBYqrhXmE9UP/mKtvFpOVU5O1aIeQHNWmhYdP5zpNNJrFmQvrljk6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:36.277898Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.2038","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:889d8bc5c6a400ff55a378079d4196d276994b47772d6e539c215e382b892096","sha256:f6b9614867e24d854a51919adada9f8bf576acefaa0ac77a96ded48c3a3b72c8"],"state_sha256":"2b30dff9a5341af4d8f48f1aa70747e5b95ef4763d379ee890cf389327f2f5c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXxejHDRg2Se9oNJ//Bj+s4k5t6kF1X4NINXD1VK/Z93tg1kTL5DBYH6uZuV3FCZLsXv7f98EBpVoKH92N54CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:01:31.141131Z","bundle_sha256":"79542c5a8f09319ee47171c9c087409ceb19354cc8e79a31d5ba59bef64d278d"}}