{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7KBGJC4JEYRJCPBITVIKAIMRYG","short_pith_number":"pith:7KBGJC4J","canonical_record":{"source":{"id":"1311.6511","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-25T23:05:45Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ff1cb69100355820852139a02e3385c6ce71b306d32da62fd25cd50c1466500a","abstract_canon_sha256":"736a06766971061d0ef66e052347c0419766ba494742e61350393c2c9bdc6071"},"schema_version":"1.0"},"canonical_sha256":"fa82648b892622913c289d50a02191c1a1a01636298ca5c4cc31ac5be71b5285","source":{"kind":"arxiv","id":"1311.6511","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6511","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6511v2","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6511","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"pith_short_12","alias_value":"7KBGJC4JEYRJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7KBGJC4JEYRJCPBI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7KBGJC4J","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7KBGJC4JEYRJCPBITVIKAIMRYG","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6511","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-25T23:05:45Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ff1cb69100355820852139a02e3385c6ce71b306d32da62fd25cd50c1466500a","abstract_canon_sha256":"736a06766971061d0ef66e052347c0419766ba494742e61350393c2c9bdc6071"},"schema_version":"1.0"},"canonical_sha256":"fa82648b892622913c289d50a02191c1a1a01636298ca5c4cc31ac5be71b5285","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:21.965853Z","signature_b64":"nLfp9Mo9TwC2zPgo7h0ScbfJFgftbckdea9e8ISEbgK5tpx/MoxKNUZONQDhC0WN5Ga5SmgmTr+xwfJO03twAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa82648b892622913c289d50a02191c1a1a01636298ca5c4cc31ac5be71b5285","last_reissued_at":"2026-05-18T01:11:21.965337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:21.965337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6511","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-18T01:11:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8DTqFNmT/9u7Ep1Ovaqsqo+b0jID6ZuxFK+2Qs7l4l7bCMPJwqY+zyP3oP2ddTc5/dEt7BpxXgNQA8i3jytAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:36:55.732434Z"},"content_sha256":"7fccf01543b203a7f3413852025547a0761621daebc9c5c48a8aa934d2e903f9","schema_version":"1.0","event_id":"sha256:7fccf01543b203a7f3413852025547a0761621daebc9c5c48a8aa934d2e903f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7KBGJC4JEYRJCPBITVIKAIMRYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intransitive Dice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Andrew Liu, Brian Conrey, James Gabbard, Katie Grant, Kent Morrison","submitted_at":"2013-11-25T23:05:45Z","abstract_excerpt":"We consider $n$-sided dice whose face values lie between $1$ and $n$ and whose faces sum to $n(n+1)/2$. For two dice $A$ and $B$, define $A \\succ B$ if it is more likely for $A$ to show a higher face than $B$. Suppose $k$ such dice $A_1,\\dots,A_k$ are randomly selected. We conjecture that the probability of ties goes to 0 as $n$ grows. We conjecture and provide some supporting evidence that---contrary to intuition---each of the $2^{k \\choose 2}$ assignments of $\\succ$ or $\\prec$ to each pair is equally likely asymptotically. For a specific example, suppose we randomly select $k$ dice $A_1,\\dot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6511","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-18T01:11:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"53Ty3mN5xv6i+6nN5VShGg5/fOoepJB8huOfC3i0UgjIyjB9Vlez9pl6xJCejd/C09pzYoD8qtHOf+jGbdMWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:36:55.733188Z"},"content_sha256":"3d205a4acf5262d739cab322ab49b66948dade3648635e9fe9640418b20853f1","schema_version":"1.0","event_id":"sha256:3d205a4acf5262d739cab322ab49b66948dade3648635e9fe9640418b20853f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KBGJC4JEYRJCPBITVIKAIMRYG/bundle.json","state_url":"https://pith.science/pith/7KBGJC4JEYRJCPBITVIKAIMRYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KBGJC4JEYRJCPBITVIKAIMRYG/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-05-22T00:36:55Z","links":{"resolver":"https://pith.science/pith/7KBGJC4JEYRJCPBITVIKAIMRYG","bundle":"https://pith.science/pith/7KBGJC4JEYRJCPBITVIKAIMRYG/bundle.json","state":"https://pith.science/pith/7KBGJC4JEYRJCPBITVIKAIMRYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KBGJC4JEYRJCPBITVIKAIMRYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7KBGJC4JEYRJCPBITVIKAIMRYG","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":"736a06766971061d0ef66e052347c0419766ba494742e61350393c2c9bdc6071","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-25T23:05:45Z","title_canon_sha256":"ff1cb69100355820852139a02e3385c6ce71b306d32da62fd25cd50c1466500a"},"schema_version":"1.0","source":{"id":"1311.6511","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6511","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6511v2","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6511","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"pith_short_12","alias_value":"7KBGJC4JEYRJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7KBGJC4JEYRJCPBI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7KBGJC4J","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:3d205a4acf5262d739cab322ab49b66948dade3648635e9fe9640418b20853f1","target":"graph","created_at":"2026-05-18T01:11:21Z","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 $n$-sided dice whose face values lie between $1$ and $n$ and whose faces sum to $n(n+1)/2$. For two dice $A$ and $B$, define $A \\succ B$ if it is more likely for $A$ to show a higher face than $B$. Suppose $k$ such dice $A_1,\\dots,A_k$ are randomly selected. We conjecture that the probability of ties goes to 0 as $n$ grows. We conjecture and provide some supporting evidence that---contrary to intuition---each of the $2^{k \\choose 2}$ assignments of $\\succ$ or $\\prec$ to each pair is equally likely asymptotically. For a specific example, suppose we randomly select $k$ dice $A_1,\\dot","authors_text":"Andrew Liu, Brian Conrey, James Gabbard, Katie Grant, Kent Morrison","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-25T23:05:45Z","title":"Intransitive Dice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6511","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:7fccf01543b203a7f3413852025547a0761621daebc9c5c48a8aa934d2e903f9","target":"record","created_at":"2026-05-18T01:11:21Z","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":"736a06766971061d0ef66e052347c0419766ba494742e61350393c2c9bdc6071","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-25T23:05:45Z","title_canon_sha256":"ff1cb69100355820852139a02e3385c6ce71b306d32da62fd25cd50c1466500a"},"schema_version":"1.0","source":{"id":"1311.6511","kind":"arxiv","version":2}},"canonical_sha256":"fa82648b892622913c289d50a02191c1a1a01636298ca5c4cc31ac5be71b5285","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa82648b892622913c289d50a02191c1a1a01636298ca5c4cc31ac5be71b5285","first_computed_at":"2026-05-18T01:11:21.965337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:21.965337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nLfp9Mo9TwC2zPgo7h0ScbfJFgftbckdea9e8ISEbgK5tpx/MoxKNUZONQDhC0WN5Ga5SmgmTr+xwfJO03twAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:21.965853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6511","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fccf01543b203a7f3413852025547a0761621daebc9c5c48a8aa934d2e903f9","sha256:3d205a4acf5262d739cab322ab49b66948dade3648635e9fe9640418b20853f1"],"state_sha256":"b93d90eb23102450fa458c1e77c142a33dfc1861a0ccc73058a2b3d726785281"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIupFhEfSdQmG00YhQxNdL+c5amF1pvNCwL/wFS4KorNXEloB185Jgl2DyKaJEF35ei6eq+vuqO8FbdXDCSSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T00:36:55.737105Z","bundle_sha256":"e1026d20f7399c7d857e5f0653ffe18cc3aac3b4277bff0b02cb56c4a0af5834"}}