{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:P3EZOY5WKJWUHM425J5YPTXB4G","short_pith_number":"pith:P3EZOY5W","schema_version":"1.0","canonical_sha256":"7ec99763b6526d43b39aea7b87cee1e1b26f48c5c644a68932298d37c7756cd7","source":{"kind":"arxiv","id":"1107.0439","version":1},"attestation_state":"computed","paper":{"title":"The Nakamura numbers for computable simple games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"H. Reiju Mihara, Masahiro Kumabe","submitted_at":"2011-07-03T09:03:44Z","abstract_excerpt":"The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with rationally is less than this number. We comprehensively study the restrictions that various properties for a simple game impose on its Nakamura number. We find that a computable game has a finite Nakamura number greater than three only if it is proper, nonstrong, and nonweak, regardless of whether it is monotonic or whether it has a finite carrier. The lack of strongness often results in alternatives that cannot be s"},"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":"1107.0439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-03T09:03:44Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"51deea2e603e8bfa819224e4ae3b3301adb56c12027baebde97648865996459c","abstract_canon_sha256":"acc13b7ee520874135350a0e04505b82b01cc370e3699811198d1ce59676693c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:53.971834Z","signature_b64":"M2RWCVx947iQrcLeSGzBaeRt3UVTMXyOOyllEAGBHm98ttZZmx10l3E3uYLuyWmi4XurEAwOb3i3pAJV4XxvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ec99763b6526d43b39aea7b87cee1e1b26f48c5c644a68932298d37c7756cd7","last_reissued_at":"2026-05-18T04:18:53.971404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:53.971404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Nakamura numbers for computable simple games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"H. Reiju Mihara, Masahiro Kumabe","submitted_at":"2011-07-03T09:03:44Z","abstract_excerpt":"The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with rationally is less than this number. We comprehensively study the restrictions that various properties for a simple game impose on its Nakamura number. We find that a computable game has a finite Nakamura number greater than three only if it is proper, nonstrong, and nonweak, regardless of whether it is monotonic or whether it has a finite carrier. The lack of strongness often results in alternatives that cannot be s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0439","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":"1107.0439","created_at":"2026-05-18T04:18:53.971468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.0439v1","created_at":"2026-05-18T04:18:53.971468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0439","created_at":"2026-05-18T04:18:53.971468+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3EZOY5WKJWU","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3EZOY5WKJWUHM42","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3EZOY5W","created_at":"2026-05-18T12:26:39.201973+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/P3EZOY5WKJWUHM425J5YPTXB4G","json":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G.json","graph_json":"https://pith.science/api/pith-number/P3EZOY5WKJWUHM425J5YPTXB4G/graph.json","events_json":"https://pith.science/api/pith-number/P3EZOY5WKJWUHM425J5YPTXB4G/events.json","paper":"https://pith.science/paper/P3EZOY5W"},"agent_actions":{"view_html":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G","download_json":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G.json","view_paper":"https://pith.science/paper/P3EZOY5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.0439&json=true","fetch_graph":"https://pith.science/api/pith-number/P3EZOY5WKJWUHM425J5YPTXB4G/graph.json","fetch_events":"https://pith.science/api/pith-number/P3EZOY5WKJWUHM425J5YPTXB4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G/action/storage_attestation","attest_author":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G/action/author_attestation","sign_citation":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G/action/citation_signature","submit_replication":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G/action/replication_record"}},"created_at":"2026-05-18T04:18:53.971468+00:00","updated_at":"2026-05-18T04:18:53.971468+00:00"}