{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HLVADSWHBEVTVUURXWTFF4BJPF","short_pith_number":"pith:HLVADSWH","schema_version":"1.0","canonical_sha256":"3aea01cac7092b3ad291bda652f029797ef56438536d74c618c20e42749c6f6b","source":{"kind":"arxiv","id":"1610.08595","version":1},"attestation_state":"computed","paper":{"title":"A Direct Construction of Non-Transitive Dice Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Levi Angel, Matt Davis","submitted_at":"2016-10-27T03:06:08Z","abstract_excerpt":"In this paper, we give a direct construction for a set of dice realizing any given tournament $T$. The construction for a tournament with $n$ vertices requires a number of sides on the order of $n$, which appears to be the best general construction to date. Our construction relies only on a standard theorem from graph theory."},"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":"1610.08595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-27T03:06:08Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"7a81848e1a6006c019ca8f365f63d90fec64ccabc0ac363c68aeaa9f0339d7cf","abstract_canon_sha256":"38194f798139e2621b120ec7623be65839bd10412fa3eeed6a8e367cfdf6307d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:07.787616Z","signature_b64":"un/2BUBY7aCBBn5SmJIPkOGxNVB65QtchlIJlw5xhWgxLegXqHTtFe8iipx1u/jID1gfabD1HrMZqoKALOwcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aea01cac7092b3ad291bda652f029797ef56438536d74c618c20e42749c6f6b","last_reissued_at":"2026-05-18T01:01:07.786940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:07.786940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Direct Construction of Non-Transitive Dice Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Levi Angel, Matt Davis","submitted_at":"2016-10-27T03:06:08Z","abstract_excerpt":"In this paper, we give a direct construction for a set of dice realizing any given tournament $T$. The construction for a tournament with $n$ vertices requires a number of sides on the order of $n$, which appears to be the best general construction to date. Our construction relies only on a standard theorem from graph theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08595","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":"1610.08595","created_at":"2026-05-18T01:01:07.787046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08595v1","created_at":"2026-05-18T01:01:07.787046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08595","created_at":"2026-05-18T01:01:07.787046+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLVADSWHBEVT","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLVADSWHBEVTVUUR","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLVADSWH","created_at":"2026-05-18T12:30:19.053100+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/HLVADSWHBEVTVUURXWTFF4BJPF","json":"https://pith.science/pith/HLVADSWHBEVTVUURXWTFF4BJPF.json","graph_json":"https://pith.science/api/pith-number/HLVADSWHBEVTVUURXWTFF4BJPF/graph.json","events_json":"https://pith.science/api/pith-number/HLVADSWHBEVTVUURXWTFF4BJPF/events.json","paper":"https://pith.science/paper/HLVADSWH"},"agent_actions":{"view_html":"https://pith.science/pith/HLVADSWHBEVTVUURXWTFF4BJPF","download_json":"https://pith.science/pith/HLVADSWHBEVTVUURXWTFF4BJPF.json","view_paper":"https://pith.science/paper/HLVADSWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08595&json=true","fetch_graph":"https://pith.science/api/pith-number/HLVADSWHBEVTVUURXWTFF4BJPF/graph.json","fetch_events":"https://pith.science/api/pith-number/HLVADSWHBEVTVUURXWTFF4BJPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLVADSWHBEVTVUURXWTFF4BJPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLVADSWHBEVTVUURXWTFF4BJPF/action/storage_attestation","attest_author":"https://pith.science/pith/HLVADSWHBEVTVUURXWTFF4BJPF/action/author_attestation","sign_citation":"https://pith.science/pith/HLVADSWHBEVTVUURXWTFF4BJPF/action/citation_signature","submit_replication":"https://pith.science/pith/HLVADSWHBEVTVUURXWTFF4BJPF/action/replication_record"}},"created_at":"2026-05-18T01:01:07.787046+00:00","updated_at":"2026-05-18T01:01:07.787046+00:00"}