{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MR65HEC7QPLDPXABKJRSCHJ2GU","short_pith_number":"pith:MR65HEC7","canonical_record":{"source":{"id":"1612.04448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-14T00:57:06Z","cross_cats_sorted":[],"title_canon_sha256":"9cc5b98e019d6ffd6213e81261e393c3d8591ee926f7a6a1ad8c62d3c40e4268","abstract_canon_sha256":"643c40482b8b5da5c3617973d523905bf44e1695c9f1bc086b3c5c385e181baa"},"schema_version":"1.0"},"canonical_sha256":"647dd3905f83d637dc015263211d3a3523d7f93643763114bd625b7f29c2066c","source":{"kind":"arxiv","id":"1612.04448","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04448","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04448v1","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04448","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"pith_short_12","alias_value":"MR65HEC7QPLD","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MR65HEC7QPLDPXAB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MR65HEC7","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MR65HEC7QPLDPXABKJRSCHJ2GU","target":"record","payload":{"canonical_record":{"source":{"id":"1612.04448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-14T00:57:06Z","cross_cats_sorted":[],"title_canon_sha256":"9cc5b98e019d6ffd6213e81261e393c3d8591ee926f7a6a1ad8c62d3c40e4268","abstract_canon_sha256":"643c40482b8b5da5c3617973d523905bf44e1695c9f1bc086b3c5c385e181baa"},"schema_version":"1.0"},"canonical_sha256":"647dd3905f83d637dc015263211d3a3523d7f93643763114bd625b7f29c2066c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:59.530918Z","signature_b64":"EihMXSFBXox/dp128uYllzm+w/CI3b1c+oM6rw8tb1dKJryZd1HkCHY6xUN+i76sTskML2Jg+hQUc6hcPnsVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"647dd3905f83d637dc015263211d3a3523d7f93643763114bd625b7f29c2066c","last_reissued_at":"2026-05-18T00:54:59.530374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:59.530374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.04448","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-18T00:54:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gmqEFVHVznRx6U/IuPEXjzNnUJQZiJmNzGWlSzEsEAEkfSHpKuAs1h3G2ad19kbwo6HGIXujiJL0BXLBEop6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:39:02.432331Z"},"content_sha256":"c20edf05a0cae4db0d31a105e8049686bda97731f159b87671771b6901502e9d","schema_version":"1.0","event_id":"sha256:c20edf05a0cae4db0d31a105e8049686bda97731f159b87671771b6901502e9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MR65HEC7QPLDPXABKJRSCHJ2GU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Knockout Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Erol Pekoz, Ilan Adler, Richard Karp, Sheldon M. Ross, Yang Cao","submitted_at":"2016-12-14T00:57:06Z","abstract_excerpt":"We consider a random knockout tournament among players $1, \\ldots, n$, in which each match involves two players. The match format is specified by the number of matches played in each round, where the constitution of the matches in a round is random. Supposing that there are numbers $v_1, \\ldots, v_n$ such that a match between $i$ and $j$ will be won by $i$ with probability $\\frac{v_i}{v_i+v_j}$, we obtain a lower bound on the tournament win probability for the best player, as well as upper and lower bounds for all the players. We also obtain additional bounds by considering the best and worst "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04448","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-18T00:54:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gXQaP9+VJzJ4Ye4MbXO7Qqw7N+cLYtT03TFinz0JQfuhOPqZAdoSe6VaQIrP6sxwlb3GjcmL2iCDNhPC87HTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:39:02.432677Z"},"content_sha256":"ca9e4090e55696caaeeabbd6cf5db2f19499aa83ff4db16eb0e2fbc9ec009cf9","schema_version":"1.0","event_id":"sha256:ca9e4090e55696caaeeabbd6cf5db2f19499aa83ff4db16eb0e2fbc9ec009cf9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MR65HEC7QPLDPXABKJRSCHJ2GU/bundle.json","state_url":"https://pith.science/pith/MR65HEC7QPLDPXABKJRSCHJ2GU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MR65HEC7QPLDPXABKJRSCHJ2GU/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-01T19:39:02Z","links":{"resolver":"https://pith.science/pith/MR65HEC7QPLDPXABKJRSCHJ2GU","bundle":"https://pith.science/pith/MR65HEC7QPLDPXABKJRSCHJ2GU/bundle.json","state":"https://pith.science/pith/MR65HEC7QPLDPXABKJRSCHJ2GU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MR65HEC7QPLDPXABKJRSCHJ2GU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MR65HEC7QPLDPXABKJRSCHJ2GU","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":"643c40482b8b5da5c3617973d523905bf44e1695c9f1bc086b3c5c385e181baa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-14T00:57:06Z","title_canon_sha256":"9cc5b98e019d6ffd6213e81261e393c3d8591ee926f7a6a1ad8c62d3c40e4268"},"schema_version":"1.0","source":{"id":"1612.04448","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04448","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04448v1","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04448","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"pith_short_12","alias_value":"MR65HEC7QPLD","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MR65HEC7QPLDPXAB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MR65HEC7","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:ca9e4090e55696caaeeabbd6cf5db2f19499aa83ff4db16eb0e2fbc9ec009cf9","target":"graph","created_at":"2026-05-18T00:54:59Z","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 consider a random knockout tournament among players $1, \\ldots, n$, in which each match involves two players. The match format is specified by the number of matches played in each round, where the constitution of the matches in a round is random. Supposing that there are numbers $v_1, \\ldots, v_n$ such that a match between $i$ and $j$ will be won by $i$ with probability $\\frac{v_i}{v_i+v_j}$, we obtain a lower bound on the tournament win probability for the best player, as well as upper and lower bounds for all the players. We also obtain additional bounds by considering the best and worst ","authors_text":"Erol Pekoz, Ilan Adler, Richard Karp, Sheldon M. Ross, Yang Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-14T00:57:06Z","title":"Random Knockout Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04448","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:c20edf05a0cae4db0d31a105e8049686bda97731f159b87671771b6901502e9d","target":"record","created_at":"2026-05-18T00:54:59Z","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":"643c40482b8b5da5c3617973d523905bf44e1695c9f1bc086b3c5c385e181baa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-14T00:57:06Z","title_canon_sha256":"9cc5b98e019d6ffd6213e81261e393c3d8591ee926f7a6a1ad8c62d3c40e4268"},"schema_version":"1.0","source":{"id":"1612.04448","kind":"arxiv","version":1}},"canonical_sha256":"647dd3905f83d637dc015263211d3a3523d7f93643763114bd625b7f29c2066c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"647dd3905f83d637dc015263211d3a3523d7f93643763114bd625b7f29c2066c","first_computed_at":"2026-05-18T00:54:59.530374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:59.530374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EihMXSFBXox/dp128uYllzm+w/CI3b1c+oM6rw8tb1dKJryZd1HkCHY6xUN+i76sTskML2Jg+hQUc6hcPnsVAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:59.530918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04448","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c20edf05a0cae4db0d31a105e8049686bda97731f159b87671771b6901502e9d","sha256:ca9e4090e55696caaeeabbd6cf5db2f19499aa83ff4db16eb0e2fbc9ec009cf9"],"state_sha256":"53f2c0a999a0f4f107b592c33693a091cf47273abe290914f3e10d7a8053de09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GmqlyY295XsZMUjR9xs1+K31W7gE9Sr950oLziKS26eDavIyV062N0zwkLLaJtanqNj2zQnnAHQ4Gnbv+SlJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:39:02.434598Z","bundle_sha256":"f0d44a2d12e0888d12c8547054d39dd4b642372085031f2ee24404bf4a71eed0"}}