{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PPP2BOD2LO2IIZGNLOXLRC3C66","short_pith_number":"pith:PPP2BOD2","schema_version":"1.0","canonical_sha256":"7bdfa0b87a5bb48464cd5baeb88b62f7a026eeae68cfb17b7cb259420fc4faed","source":{"kind":"arxiv","id":"1905.01750","version":1},"attestation_state":"computed","paper":{"title":"Generalized Intransitive Dice II: Partition Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.DS","authors_text":"Ethan Akin, Julia Saccamano","submitted_at":"2019-05-05T21:35:20Z","abstract_excerpt":"A generalized $N$-sided die is a random variable $D$ on a sample space of $N$ equally likely outcomes taking values in the set of positive integers. We say of independent $N$ sided dice $D_i, D_j$ that $D_i$ beats $D_j$, written $D_i \\to D_j$, if $Prob(D_i > D_j) > \\frac{1}{2} $. A collection of dice $\\{ D_i : i = 1, \\dots, n \\}$ models a tournament on the set $[n] = \\{ 1, 2, \\dots, n \\}$, i.e. a complete digraph with $n$ vertices, when $D_i \\to D_j$ if and only if $i \\to j$ in the tournament. By using $n$-fold partitions of the set $[Nn] $ with each set of size $N$ we can model an arbitrary t"},"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":"1905.01750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-05-05T21:35:20Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7f2e234ce7c5159d1068eb9c593c53e40f6646815d23a8ec2714610677dc5a50","abstract_canon_sha256":"02706629cc7dcaf2e97636060fd78f8bc8b89f757586439768aec9294539d5b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:57.545038Z","signature_b64":"A8TvgshciNwwrnkIqQ6ralwKuadSARaYJITuitArG/SEmQbmiYgcZ5NfDWQYetSv/R7JIra8DN97X6pe7OzyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bdfa0b87a5bb48464cd5baeb88b62f7a026eeae68cfb17b7cb259420fc4faed","last_reissued_at":"2026-05-17T23:46:57.544497Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:57.544497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Intransitive Dice II: Partition Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.DS","authors_text":"Ethan Akin, Julia Saccamano","submitted_at":"2019-05-05T21:35:20Z","abstract_excerpt":"A generalized $N$-sided die is a random variable $D$ on a sample space of $N$ equally likely outcomes taking values in the set of positive integers. We say of independent $N$ sided dice $D_i, D_j$ that $D_i$ beats $D_j$, written $D_i \\to D_j$, if $Prob(D_i > D_j) > \\frac{1}{2} $. A collection of dice $\\{ D_i : i = 1, \\dots, n \\}$ models a tournament on the set $[n] = \\{ 1, 2, \\dots, n \\}$, i.e. a complete digraph with $n$ vertices, when $D_i \\to D_j$ if and only if $i \\to j$ in the tournament. By using $n$-fold partitions of the set $[Nn] $ with each set of size $N$ we can model an arbitrary t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01750","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.01750","created_at":"2026-05-17T23:46:57.544580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01750v1","created_at":"2026-05-17T23:46:57.544580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01750","created_at":"2026-05-17T23:46:57.544580+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPP2BOD2LO2I","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPP2BOD2LO2IIZGN","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPP2BOD2","created_at":"2026-05-18T12:33:24.271573+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/PPP2BOD2LO2IIZGNLOXLRC3C66","json":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66.json","graph_json":"https://pith.science/api/pith-number/PPP2BOD2LO2IIZGNLOXLRC3C66/graph.json","events_json":"https://pith.science/api/pith-number/PPP2BOD2LO2IIZGNLOXLRC3C66/events.json","paper":"https://pith.science/paper/PPP2BOD2"},"agent_actions":{"view_html":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66","download_json":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66.json","view_paper":"https://pith.science/paper/PPP2BOD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01750&json=true","fetch_graph":"https://pith.science/api/pith-number/PPP2BOD2LO2IIZGNLOXLRC3C66/graph.json","fetch_events":"https://pith.science/api/pith-number/PPP2BOD2LO2IIZGNLOXLRC3C66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66/action/storage_attestation","attest_author":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66/action/author_attestation","sign_citation":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66/action/citation_signature","submit_replication":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66/action/replication_record"}},"created_at":"2026-05-17T23:46:57.544580+00:00","updated_at":"2026-05-17T23:46:57.544580+00:00"}