{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:E7GVIW5KPO3ACWBVDAVMNR5CAX","short_pith_number":"pith:E7GVIW5K","schema_version":"1.0","canonical_sha256":"27cd545baa7bb6015835182ac6c7a205ea39dffb4b4002225081e02980d291c6","source":{"kind":"arxiv","id":"0908.2038","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0908.2038","created_at":"2026-05-18T02:57:36.277387+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.2038v2","created_at":"2026-05-18T02:57:36.277387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.2038","created_at":"2026-05-18T02:57:36.277387+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7GVIW5KPO3A","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7GVIW5KPO3ACWBV","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7GVIW5K","created_at":"2026-05-18T12:25:59.703012+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX","json":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX.json","graph_json":"https://pith.science/api/pith-number/E7GVIW5KPO3ACWBVDAVMNR5CAX/graph.json","events_json":"https://pith.science/api/pith-number/E7GVIW5KPO3ACWBVDAVMNR5CAX/events.json","paper":"https://pith.science/paper/E7GVIW5K"},"agent_actions":{"view_html":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX","download_json":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX.json","view_paper":"https://pith.science/paper/E7GVIW5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.2038&json=true","fetch_graph":"https://pith.science/api/pith-number/E7GVIW5KPO3ACWBVDAVMNR5CAX/graph.json","fetch_events":"https://pith.science/api/pith-number/E7GVIW5KPO3ACWBVDAVMNR5CAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX/action/storage_attestation","attest_author":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX/action/author_attestation","sign_citation":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX/action/citation_signature","submit_replication":"https://pith.science/pith/E7GVIW5KPO3ACWBVDAVMNR5CAX/action/replication_record"}},"created_at":"2026-05-18T02:57:36.277387+00:00","updated_at":"2026-05-18T02:57:36.277387+00:00"}