{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:76VBPRE5OLRZA63B6WR5IWKRML","short_pith_number":"pith:76VBPRE5","schema_version":"1.0","canonical_sha256":"ffaa17c49d72e3907b61f5a3d4595162c8753ca2b3164a11309459fccb985f67","source":{"kind":"arxiv","id":"1102.4037","version":1},"attestation_state":"computed","paper":{"title":"Computability of simple games: A complete investigation of the sixty-four possibilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.LO"],"primary_cat":"cs.GT","authors_text":"H. Reiju Mihara, Masahiro Kumabe","submitted_at":"2011-02-20T02:19:21Z","abstract_excerpt":"Classify simple games into sixteen \"types\" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier) and algorithmic computability. For each such class, we either show that it is empty or give an example of a game belonging to it. We observe that if a type contains an infinite game, then it contains both computable ones and noncomputable ones. This strongly suggests that computability is logically, as well as conceptually, unrelated to the conventional axi"},"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":"1102.4037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-20T02:19:21Z","cross_cats_sorted":["cs.LO","math.LO"],"title_canon_sha256":"29ca9e55e1e79ac5af5f9d53502b59777cf8f80c90f523ca380d50804d8f8685","abstract_canon_sha256":"a97e3343baab0099f9354211caa66aaf941f0083fde47f668779dcb1337c07b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:54.500965Z","signature_b64":"M4fBsSyj5zvJmktZwRzIt4qMGYKKn8dDs/VZhf8kezDGvi4gnILzr0oQAHPIDcc1fSZ8RBlCcBsuwjJFXAbFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffaa17c49d72e3907b61f5a3d4595162c8753ca2b3164a11309459fccb985f67","last_reissued_at":"2026-05-18T04:18:54.500609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:54.500609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computability of simple games: A complete investigation of the sixty-four possibilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.LO"],"primary_cat":"cs.GT","authors_text":"H. Reiju Mihara, Masahiro Kumabe","submitted_at":"2011-02-20T02:19:21Z","abstract_excerpt":"Classify simple games into sixteen \"types\" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier) and algorithmic computability. For each such class, we either show that it is empty or give an example of a game belonging to it. We observe that if a type contains an infinite game, then it contains both computable ones and noncomputable ones. This strongly suggests that computability is logically, as well as conceptually, unrelated to the conventional axi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4037","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":"1102.4037","created_at":"2026-05-18T04:18:54.500663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4037v1","created_at":"2026-05-18T04:18:54.500663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4037","created_at":"2026-05-18T04:18:54.500663+00:00"},{"alias_kind":"pith_short_12","alias_value":"76VBPRE5OLRZ","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"76VBPRE5OLRZA63B","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"76VBPRE5","created_at":"2026-05-18T12:26:22.705136+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/76VBPRE5OLRZA63B6WR5IWKRML","json":"https://pith.science/pith/76VBPRE5OLRZA63B6WR5IWKRML.json","graph_json":"https://pith.science/api/pith-number/76VBPRE5OLRZA63B6WR5IWKRML/graph.json","events_json":"https://pith.science/api/pith-number/76VBPRE5OLRZA63B6WR5IWKRML/events.json","paper":"https://pith.science/paper/76VBPRE5"},"agent_actions":{"view_html":"https://pith.science/pith/76VBPRE5OLRZA63B6WR5IWKRML","download_json":"https://pith.science/pith/76VBPRE5OLRZA63B6WR5IWKRML.json","view_paper":"https://pith.science/paper/76VBPRE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4037&json=true","fetch_graph":"https://pith.science/api/pith-number/76VBPRE5OLRZA63B6WR5IWKRML/graph.json","fetch_events":"https://pith.science/api/pith-number/76VBPRE5OLRZA63B6WR5IWKRML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76VBPRE5OLRZA63B6WR5IWKRML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76VBPRE5OLRZA63B6WR5IWKRML/action/storage_attestation","attest_author":"https://pith.science/pith/76VBPRE5OLRZA63B6WR5IWKRML/action/author_attestation","sign_citation":"https://pith.science/pith/76VBPRE5OLRZA63B6WR5IWKRML/action/citation_signature","submit_replication":"https://pith.science/pith/76VBPRE5OLRZA63B6WR5IWKRML/action/replication_record"}},"created_at":"2026-05-18T04:18:54.500663+00:00","updated_at":"2026-05-18T04:18:54.500663+00:00"}