{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PPP2BOD2LO2IIZGNLOXLRC3C66","short_pith_number":"pith:PPP2BOD2","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"},"canonical_sha256":"7bdfa0b87a5bb48464cd5baeb88b62f7a026eeae68cfb17b7cb259420fc4faed","source":{"kind":"arxiv","id":"1905.01750","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01750","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01750v1","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01750","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"PPP2BOD2LO2I","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PPP2BOD2LO2IIZGN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PPP2BOD2","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PPP2BOD2LO2IIZGNLOXLRC3C66","target":"record","payload":{"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"},"canonical_sha256":"7bdfa0b87a5bb48464cd5baeb88b62f7a026eeae68cfb17b7cb259420fc4faed","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"},"source_kind":"arxiv","source_id":"1905.01750","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-17T23:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3qEVGuOAubtSF5/RtFsdW1IY24Fv7SEJIn74o6ypPnAbTQC2NJAQzc4KXR0XcD6hTEZSXSkuVIPe/F5BiQ3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:47:36.171471Z"},"content_sha256":"00ff82a4651baf676b48c4623b79dbe15cf3b104cb96031c436b1d880760bab3","schema_version":"1.0","event_id":"sha256:00ff82a4651baf676b48c4623b79dbe15cf3b104cb96031c436b1d880760bab3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PPP2BOD2LO2IIZGNLOXLRC3C66","target":"graph","payload":{"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"},"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-17T23:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Y/1QTO52IXGJd4n8QGJVRTy21dEMeW3M17Wk1DnjabFtaImOj2b/0AUWbW4g30Oe/qT5k4Dpcon8Msvw4h4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:47:36.172226Z"},"content_sha256":"e49dc9fc26e887e71013b8354b81f9d63428e8c7f4e3b9366a53054266e0c944","schema_version":"1.0","event_id":"sha256:e49dc9fc26e887e71013b8354b81f9d63428e8c7f4e3b9366a53054266e0c944"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66/bundle.json","state_url":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPP2BOD2LO2IIZGNLOXLRC3C66/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-02T20:47:36Z","links":{"resolver":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66","bundle":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66/bundle.json","state":"https://pith.science/pith/PPP2BOD2LO2IIZGNLOXLRC3C66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPP2BOD2LO2IIZGNLOXLRC3C66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PPP2BOD2LO2IIZGNLOXLRC3C66","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":"02706629cc7dcaf2e97636060fd78f8bc8b89f757586439768aec9294539d5b8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-05-05T21:35:20Z","title_canon_sha256":"7f2e234ce7c5159d1068eb9c593c53e40f6646815d23a8ec2714610677dc5a50"},"schema_version":"1.0","source":{"id":"1905.01750","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01750","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01750v1","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01750","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"PPP2BOD2LO2I","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PPP2BOD2LO2IIZGN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PPP2BOD2","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:e49dc9fc26e887e71013b8354b81f9d63428e8c7f4e3b9366a53054266e0c944","target":"graph","created_at":"2026-05-17T23:46:57Z","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":"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","authors_text":"Ethan Akin, Julia Saccamano","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-05-05T21:35:20Z","title":"Generalized Intransitive Dice II: Partition Constructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01750","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:00ff82a4651baf676b48c4623b79dbe15cf3b104cb96031c436b1d880760bab3","target":"record","created_at":"2026-05-17T23:46:57Z","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":"02706629cc7dcaf2e97636060fd78f8bc8b89f757586439768aec9294539d5b8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-05-05T21:35:20Z","title_canon_sha256":"7f2e234ce7c5159d1068eb9c593c53e40f6646815d23a8ec2714610677dc5a50"},"schema_version":"1.0","source":{"id":"1905.01750","kind":"arxiv","version":1}},"canonical_sha256":"7bdfa0b87a5bb48464cd5baeb88b62f7a026eeae68cfb17b7cb259420fc4faed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bdfa0b87a5bb48464cd5baeb88b62f7a026eeae68cfb17b7cb259420fc4faed","first_computed_at":"2026-05-17T23:46:57.544497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:57.544497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A8TvgshciNwwrnkIqQ6ralwKuadSARaYJITuitArG/SEmQbmiYgcZ5NfDWQYetSv/R7JIra8DN97X6pe7OzyAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:57.545038Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01750","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00ff82a4651baf676b48c4623b79dbe15cf3b104cb96031c436b1d880760bab3","sha256:e49dc9fc26e887e71013b8354b81f9d63428e8c7f4e3b9366a53054266e0c944"],"state_sha256":"b04f9519b368d32a5c6689fc3fa780f49a6dc32f480fa1dd60d8116af9ab12b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qoDDdXpVuV5NN+h2Pa/Vr/A+PMBrgqigQQdrV2KO4hSkA8zJWD89w4813kkaoIra/x/Z6jl2lAbCITCP/AKKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:47:36.175218Z","bundle_sha256":"4a7add75b650097814796badc87f771dd5404fe39f96f359a546a630a35b55b5"}}