{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BQI5CXAXXLVTHCWULXIWGWTKOH","short_pith_number":"pith:BQI5CXAX","canonical_record":{"source":{"id":"2603.06886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-03-06T21:07:15Z","cross_cats_sorted":[],"title_canon_sha256":"c133bce910bc5e97593bd109faac7dbf1faaa6afd8811c02c6d3e70730cce8ee","abstract_canon_sha256":"0426d08b5164e736e00539c6dc44d7db6295179a6abcdcf4cbea5d8f7f0e3571"},"schema_version":"1.0"},"canonical_sha256":"0c11d15c17baeb338ad45dd1635a6a71f1d68e3fcf0b320a062826ba1b834d62","source":{"kind":"arxiv","id":"2603.06886","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.06886","created_at":"2026-06-02T01:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"2603.06886v2","created_at":"2026-06-02T01:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.06886","created_at":"2026-06-02T01:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"BQI5CXAXXLVT","created_at":"2026-06-02T01:03:44Z"},{"alias_kind":"pith_short_16","alias_value":"BQI5CXAXXLVTHCWU","created_at":"2026-06-02T01:03:44Z"},{"alias_kind":"pith_short_8","alias_value":"BQI5CXAX","created_at":"2026-06-02T01:03:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BQI5CXAXXLVTHCWULXIWGWTKOH","target":"record","payload":{"canonical_record":{"source":{"id":"2603.06886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-03-06T21:07:15Z","cross_cats_sorted":[],"title_canon_sha256":"c133bce910bc5e97593bd109faac7dbf1faaa6afd8811c02c6d3e70730cce8ee","abstract_canon_sha256":"0426d08b5164e736e00539c6dc44d7db6295179a6abcdcf4cbea5d8f7f0e3571"},"schema_version":"1.0"},"canonical_sha256":"0c11d15c17baeb338ad45dd1635a6a71f1d68e3fcf0b320a062826ba1b834d62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:44.696720Z","signature_b64":"nKHPu59gS1QdFO+2d3zbaePLaNgzSatishAxf95g0ihhnUzPGaP1AQJeTQ2NxOtPqBs4Vka6I+KwzXGOEOKYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c11d15c17baeb338ad45dd1635a6a71f1d68e3fcf0b320a062826ba1b834d62","last_reissued_at":"2026-06-02T01:03:44.696077Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:44.696077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.06886","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-06-02T01:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKb825eKY169eKcWJnO2JNTCtdXAYejt0FoJuAAYW6fXKbje51OfM+aUV4/bhO+mzcUWQ29U+qKEaZUjaC/mCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:54:46.433476Z"},"content_sha256":"6c2d0c2733b8f9e4abc0f217359d6a1c510c71271a2fc8dee79da835f752224a","schema_version":"1.0","event_id":"sha256:6c2d0c2733b8f9e4abc0f217359d6a1c510c71271a2fc8dee79da835f752224a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BQI5CXAXXLVTHCWULXIWGWTKOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Size of the Largest Distinct Extreme Score Set in Random Round-Robin Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Yaakov Malinovsky","submitted_at":"2026-03-06T21:07:15Z","abstract_excerpt":"We consider a general round-robin tournament model with equally strong players, where $X_{ij}$ denotes the score of player $i$ against player $j$. We assume that $X_{ij}$ takes values in a countable subset of $[0,1]$ and satisfies $X_{ij}+X_{ji}=1$. We prove that if $k(n)\\to\\infty$ as $n\\to\\infty$ and $ \\frac{k(n)^2\\log\\!\\bigl(n/k(n)\\bigr)}{\\sqrt n}\\to 0, $ then, with probability tending to one, the largest $k(n)$ scores are all distinct. In particular, this holds whenever $k(n)=o\\!\\Bigl(\\bigl(n/\\log n\\bigr)^{1/4}\\Bigr).$ By symmetry, the same conclusion also holds for the lowest $k(n)$ scores"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.06886","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.06886/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-02T01:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZovI7KBgVupnlCH4RjvT9MYVpL407roXN4oCCW5D27mseZVKDnnYLmLMq0TZHxcypUmyuPte0XtxBiXvzUxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:54:46.433841Z"},"content_sha256":"a193fa24e512274b63e09316329ed3b2c4426f7daaaf9f8808bea52d95342368","schema_version":"1.0","event_id":"sha256:a193fa24e512274b63e09316329ed3b2c4426f7daaaf9f8808bea52d95342368"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQI5CXAXXLVTHCWULXIWGWTKOH/bundle.json","state_url":"https://pith.science/pith/BQI5CXAXXLVTHCWULXIWGWTKOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQI5CXAXXLVTHCWULXIWGWTKOH/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-27T05:54:46Z","links":{"resolver":"https://pith.science/pith/BQI5CXAXXLVTHCWULXIWGWTKOH","bundle":"https://pith.science/pith/BQI5CXAXXLVTHCWULXIWGWTKOH/bundle.json","state":"https://pith.science/pith/BQI5CXAXXLVTHCWULXIWGWTKOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQI5CXAXXLVTHCWULXIWGWTKOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BQI5CXAXXLVTHCWULXIWGWTKOH","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":"0426d08b5164e736e00539c6dc44d7db6295179a6abcdcf4cbea5d8f7f0e3571","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-03-06T21:07:15Z","title_canon_sha256":"c133bce910bc5e97593bd109faac7dbf1faaa6afd8811c02c6d3e70730cce8ee"},"schema_version":"1.0","source":{"id":"2603.06886","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.06886","created_at":"2026-06-02T01:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"2603.06886v2","created_at":"2026-06-02T01:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.06886","created_at":"2026-06-02T01:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"BQI5CXAXXLVT","created_at":"2026-06-02T01:03:44Z"},{"alias_kind":"pith_short_16","alias_value":"BQI5CXAXXLVTHCWU","created_at":"2026-06-02T01:03:44Z"},{"alias_kind":"pith_short_8","alias_value":"BQI5CXAX","created_at":"2026-06-02T01:03:44Z"}],"graph_snapshots":[{"event_id":"sha256:a193fa24e512274b63e09316329ed3b2c4426f7daaaf9f8808bea52d95342368","target":"graph","created_at":"2026-06-02T01:03:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.06886/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a general round-robin tournament model with equally strong players, where $X_{ij}$ denotes the score of player $i$ against player $j$. We assume that $X_{ij}$ takes values in a countable subset of $[0,1]$ and satisfies $X_{ij}+X_{ji}=1$. We prove that if $k(n)\\to\\infty$ as $n\\to\\infty$ and $ \\frac{k(n)^2\\log\\!\\bigl(n/k(n)\\bigr)}{\\sqrt n}\\to 0, $ then, with probability tending to one, the largest $k(n)$ scores are all distinct. In particular, this holds whenever $k(n)=o\\!\\Bigl(\\bigl(n/\\log n\\bigr)^{1/4}\\Bigr).$ By symmetry, the same conclusion also holds for the lowest $k(n)$ scores","authors_text":"Yaakov Malinovsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-03-06T21:07:15Z","title":"On the Size of the Largest Distinct Extreme Score Set in Random Round-Robin Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.06886","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:6c2d0c2733b8f9e4abc0f217359d6a1c510c71271a2fc8dee79da835f752224a","target":"record","created_at":"2026-06-02T01:03:44Z","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":"0426d08b5164e736e00539c6dc44d7db6295179a6abcdcf4cbea5d8f7f0e3571","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-03-06T21:07:15Z","title_canon_sha256":"c133bce910bc5e97593bd109faac7dbf1faaa6afd8811c02c6d3e70730cce8ee"},"schema_version":"1.0","source":{"id":"2603.06886","kind":"arxiv","version":2}},"canonical_sha256":"0c11d15c17baeb338ad45dd1635a6a71f1d68e3fcf0b320a062826ba1b834d62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c11d15c17baeb338ad45dd1635a6a71f1d68e3fcf0b320a062826ba1b834d62","first_computed_at":"2026-06-02T01:03:44.696077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:44.696077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nKHPu59gS1QdFO+2d3zbaePLaNgzSatishAxf95g0ihhnUzPGaP1AQJeTQ2NxOtPqBs4Vka6I+KwzXGOEOKYBw==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:44.696720Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.06886","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c2d0c2733b8f9e4abc0f217359d6a1c510c71271a2fc8dee79da835f752224a","sha256:a193fa24e512274b63e09316329ed3b2c4426f7daaaf9f8808bea52d95342368"],"state_sha256":"b1a4638b4c5e5675fb80ea5627ea2184cce43b864bbfb1bc5d9207ef457d5f4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W3VgZLXLqpZIL/6TYe5nh3kaK+h4vLHuyZCoXCYp6kETfKDuTr5E7ffXBlvvswMNCG5rQQUeDHlMBJcTAkZdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T05:54:46.435828Z","bundle_sha256":"3616be465675c87a9264a5bf0b2ad0cc3da5e2eac4123715368a47a229178a52"}}