{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Q4OMQ4VCGVA4JOGNKHD6DV7NIB","short_pith_number":"pith:Q4OMQ4VC","schema_version":"1.0","canonical_sha256":"871cc872a23541c4b8cd51c7e1d7ed407f1591d64b5f222ef7fec5b5578a1fb2","source":{"kind":"arxiv","id":"2011.10067","version":2},"attestation_state":"computed","paper":{"title":"Intransitive dice tournament is not quasirandom","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Elisabetta Cornacchia, Jan H\\k{a}z{\\l}a","submitted_at":"2020-11-19T19:02:58Z","abstract_excerpt":"We settle a version of the conjecture about intransitive dice posed by Conrey, Gabbard, Grant, Liu and Morrison in 2016 and Polymath in 2017. We consider generalized dice with $n$ faces and we say that a die $A$ beats $B$ if a random face of $A$ is more likely to show a higher number than a random face of $B$. We study random dice with faces drawn iid from the uniform distribution on $[0,1]$ and conditioned on the sum of the faces equal to $n/2$. Considering the \"beats\" relation for three such random dice, Polymath showed that each of eight possible tournaments between them is asymptotically e"},"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":"2011.10067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2020-11-19T19:02:58Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7ff8a64a9ebd34cbbdcc364fef629daba1d283b4b58fa9fc547c02ab3a0ac8de","abstract_canon_sha256":"2eea4f1c8e0a46df185c4e8c770cf41dd9eaccaceee30205fa11856baeed8852"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:01.665765Z","signature_b64":"JPJTW2jksDmhHSNlZvtQIYBdNSQ9AOBLFIJlJ+QHZTP0CnmlnBAxCL/M4pBZR8qYagpMRXs+6xUPN85r0l4uBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"871cc872a23541c4b8cd51c7e1d7ed407f1591d64b5f222ef7fec5b5578a1fb2","last_reissued_at":"2026-07-05T09:32:01.665364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:01.665364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intransitive dice tournament is not quasirandom","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Elisabetta Cornacchia, Jan H\\k{a}z{\\l}a","submitted_at":"2020-11-19T19:02:58Z","abstract_excerpt":"We settle a version of the conjecture about intransitive dice posed by Conrey, Gabbard, Grant, Liu and Morrison in 2016 and Polymath in 2017. We consider generalized dice with $n$ faces and we say that a die $A$ beats $B$ if a random face of $A$ is more likely to show a higher number than a random face of $B$. We study random dice with faces drawn iid from the uniform distribution on $[0,1]$ and conditioned on the sum of the faces equal to $n/2$. Considering the \"beats\" relation for three such random dice, Polymath showed that each of eight possible tournaments between them is asymptotically e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.10067","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/2011.10067/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2011.10067","created_at":"2026-07-05T09:32:01.665422+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.10067v2","created_at":"2026-07-05T09:32:01.665422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.10067","created_at":"2026-07-05T09:32:01.665422+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4OMQ4VCGVA4","created_at":"2026-07-05T09:32:01.665422+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4OMQ4VCGVA4JOGN","created_at":"2026-07-05T09:32:01.665422+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4OMQ4VC","created_at":"2026-07-05T09:32:01.665422+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/Q4OMQ4VCGVA4JOGNKHD6DV7NIB","json":"https://pith.science/pith/Q4OMQ4VCGVA4JOGNKHD6DV7NIB.json","graph_json":"https://pith.science/api/pith-number/Q4OMQ4VCGVA4JOGNKHD6DV7NIB/graph.json","events_json":"https://pith.science/api/pith-number/Q4OMQ4VCGVA4JOGNKHD6DV7NIB/events.json","paper":"https://pith.science/paper/Q4OMQ4VC"},"agent_actions":{"view_html":"https://pith.science/pith/Q4OMQ4VCGVA4JOGNKHD6DV7NIB","download_json":"https://pith.science/pith/Q4OMQ4VCGVA4JOGNKHD6DV7NIB.json","view_paper":"https://pith.science/paper/Q4OMQ4VC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.10067&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4OMQ4VCGVA4JOGNKHD6DV7NIB/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4OMQ4VCGVA4JOGNKHD6DV7NIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4OMQ4VCGVA4JOGNKHD6DV7NIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4OMQ4VCGVA4JOGNKHD6DV7NIB/action/storage_attestation","attest_author":"https://pith.science/pith/Q4OMQ4VCGVA4JOGNKHD6DV7NIB/action/author_attestation","sign_citation":"https://pith.science/pith/Q4OMQ4VCGVA4JOGNKHD6DV7NIB/action/citation_signature","submit_replication":"https://pith.science/pith/Q4OMQ4VCGVA4JOGNKHD6DV7NIB/action/replication_record"}},"created_at":"2026-07-05T09:32:01.665422+00:00","updated_at":"2026-07-05T09:32:01.665422+00:00"}