{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JAY6AD6H6CGR4O3DTPVEQTEJZT","short_pith_number":"pith:JAY6AD6H","canonical_record":{"source":{"id":"1712.00210","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-12-01T06:59:11Z","cross_cats_sorted":[],"title_canon_sha256":"ced1af40d6bbd5a5f8b0196e932435c55eced9392de177877a568de875b8d1b1","abstract_canon_sha256":"81e8ce98ae3d49ce70c16fdea617ecf2b85645d35907e45fd7c4c2b3599a0c11"},"schema_version":"1.0"},"canonical_sha256":"4831e00fc7f08d1e3b639bea484c89ccfba9df13808a437675c79874bbdf0cd4","source":{"kind":"arxiv","id":"1712.00210","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00210","created_at":"2026-05-17T23:42:30Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00210v4","created_at":"2026-05-17T23:42:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00210","created_at":"2026-05-17T23:42:30Z"},{"alias_kind":"pith_short_12","alias_value":"JAY6AD6H6CGR","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JAY6AD6H6CGR4O3D","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JAY6AD6H","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JAY6AD6H6CGR4O3DTPVEQTEJZT","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00210","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-12-01T06:59:11Z","cross_cats_sorted":[],"title_canon_sha256":"ced1af40d6bbd5a5f8b0196e932435c55eced9392de177877a568de875b8d1b1","abstract_canon_sha256":"81e8ce98ae3d49ce70c16fdea617ecf2b85645d35907e45fd7c4c2b3599a0c11"},"schema_version":"1.0"},"canonical_sha256":"4831e00fc7f08d1e3b639bea484c89ccfba9df13808a437675c79874bbdf0cd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:30.992651Z","signature_b64":"3jZJivXbeU8N5AbddCRITFX+mtwY8cx9opp1/HlMmf7zL63GKSmzYOr15abf+AYGvELCRI52/5zoUZVPXijAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4831e00fc7f08d1e3b639bea484c89ccfba9df13808a437675c79874bbdf0cd4","last_reissued_at":"2026-05-17T23:42:30.992124Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:30.992124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00210","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-17T23:42:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5Z7/6gKnYotGsB4y5eW/4vBBpqC0HSb8yTYow6eucYWsuBnnBdAEpSubFUjmvW5M4e1Xc534oz6F6J8eBtCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:09:59.277779Z"},"content_sha256":"a0d38543d3fc745b9973e8b0410ba99f4c32719fe7ef96cbb67d6d897dd05a4a","schema_version":"1.0","event_id":"sha256:a0d38543d3fc745b9973e8b0410ba99f4c32719fe7ef96cbb67d6d897dd05a4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JAY6AD6H6CGR4O3DTPVEQTEJZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An upper bound on the size of avoidance couplings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Erik Bates, Lisa Sauermann","submitted_at":"2017-12-01T06:59:11Z","abstract_excerpt":"We show that a coupling of non-colliding simple random walkers on the complete graph on $n$ vertices can include at most $n - \\log n$ walkers. This improves the only previously known upper bound of $n-2$ due to Angel, Holroyd, Martin, Wilson, and Winkler ({\\it Electron.~Commun.~Probab.~18}, 2013). The proof considers couplings of i.i.d.~sequences of Bernoulli random variables satisfying a similar avoidance property, for which there is separate interest. Our bound in this setting should be closer to optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00210","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-17T23:42:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4FLJ3MPVVKVczJQdI6qg2UsU2eWJIYUhPpGitXFhoRndWbYKPxNWUIRlW8GdqlnE6+AstIRQBGe42MLybuZUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:09:59.278464Z"},"content_sha256":"2f46499b17d28a64281a1b6aab5fc33e1aed80edc79137a6c78341ad9177d1f7","schema_version":"1.0","event_id":"sha256:2f46499b17d28a64281a1b6aab5fc33e1aed80edc79137a6c78341ad9177d1f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JAY6AD6H6CGR4O3DTPVEQTEJZT/bundle.json","state_url":"https://pith.science/pith/JAY6AD6H6CGR4O3DTPVEQTEJZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JAY6AD6H6CGR4O3DTPVEQTEJZT/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-07T20:09:59Z","links":{"resolver":"https://pith.science/pith/JAY6AD6H6CGR4O3DTPVEQTEJZT","bundle":"https://pith.science/pith/JAY6AD6H6CGR4O3DTPVEQTEJZT/bundle.json","state":"https://pith.science/pith/JAY6AD6H6CGR4O3DTPVEQTEJZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JAY6AD6H6CGR4O3DTPVEQTEJZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JAY6AD6H6CGR4O3DTPVEQTEJZT","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":"81e8ce98ae3d49ce70c16fdea617ecf2b85645d35907e45fd7c4c2b3599a0c11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-12-01T06:59:11Z","title_canon_sha256":"ced1af40d6bbd5a5f8b0196e932435c55eced9392de177877a568de875b8d1b1"},"schema_version":"1.0","source":{"id":"1712.00210","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00210","created_at":"2026-05-17T23:42:30Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00210v4","created_at":"2026-05-17T23:42:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00210","created_at":"2026-05-17T23:42:30Z"},{"alias_kind":"pith_short_12","alias_value":"JAY6AD6H6CGR","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JAY6AD6H6CGR4O3D","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JAY6AD6H","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:2f46499b17d28a64281a1b6aab5fc33e1aed80edc79137a6c78341ad9177d1f7","target":"graph","created_at":"2026-05-17T23:42:30Z","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":"We show that a coupling of non-colliding simple random walkers on the complete graph on $n$ vertices can include at most $n - \\log n$ walkers. This improves the only previously known upper bound of $n-2$ due to Angel, Holroyd, Martin, Wilson, and Winkler ({\\it Electron.~Commun.~Probab.~18}, 2013). The proof considers couplings of i.i.d.~sequences of Bernoulli random variables satisfying a similar avoidance property, for which there is separate interest. Our bound in this setting should be closer to optimal.","authors_text":"Erik Bates, Lisa Sauermann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-12-01T06:59:11Z","title":"An upper bound on the size of avoidance couplings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00210","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:a0d38543d3fc745b9973e8b0410ba99f4c32719fe7ef96cbb67d6d897dd05a4a","target":"record","created_at":"2026-05-17T23:42:30Z","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":"81e8ce98ae3d49ce70c16fdea617ecf2b85645d35907e45fd7c4c2b3599a0c11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-12-01T06:59:11Z","title_canon_sha256":"ced1af40d6bbd5a5f8b0196e932435c55eced9392de177877a568de875b8d1b1"},"schema_version":"1.0","source":{"id":"1712.00210","kind":"arxiv","version":4}},"canonical_sha256":"4831e00fc7f08d1e3b639bea484c89ccfba9df13808a437675c79874bbdf0cd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4831e00fc7f08d1e3b639bea484c89ccfba9df13808a437675c79874bbdf0cd4","first_computed_at":"2026-05-17T23:42:30.992124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:30.992124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3jZJivXbeU8N5AbddCRITFX+mtwY8cx9opp1/HlMmf7zL63GKSmzYOr15abf+AYGvELCRI52/5zoUZVPXijAAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:30.992651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00210","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0d38543d3fc745b9973e8b0410ba99f4c32719fe7ef96cbb67d6d897dd05a4a","sha256:2f46499b17d28a64281a1b6aab5fc33e1aed80edc79137a6c78341ad9177d1f7"],"state_sha256":"c0d012e89df774670cc2c4e2c2db34c9e612a6f7203788d493aaf307557a40d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xqhCZZrH12cIsKJFFExA1TbaluQtvwqS/JaJPG9+HmACtNiDm7BCOlhRIqRYArAmfQnaceJQpd6BCky/VV9OAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:09:59.282157Z","bundle_sha256":"63500873307b12a245c19717e94692ee9726a50d5d779b3e2d4d3daea6048553"}}