{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:P3EZOY5WKJWUHM425J5YPTXB4G","short_pith_number":"pith:P3EZOY5W","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"},"canonical_sha256":"7ec99763b6526d43b39aea7b87cee1e1b26f48c5c644a68932298d37c7756cd7","source":{"kind":"arxiv","id":"1107.0439","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0439","created_at":"2026-05-18T04:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0439v1","created_at":"2026-05-18T04:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0439","created_at":"2026-05-18T04:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"P3EZOY5WKJWU","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"P3EZOY5WKJWUHM42","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"P3EZOY5W","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:P3EZOY5WKJWUHM425J5YPTXB4G","target":"record","payload":{"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"},"canonical_sha256":"7ec99763b6526d43b39aea7b87cee1e1b26f48c5c644a68932298d37c7756cd7","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"},"source_kind":"arxiv","source_id":"1107.0439","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-18T04:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+LvxjyIbY3ETtLtLZhxCM4ouJ/Hc0mRvcmZEC2bl2Ore+ZpyYcKswoXOYhpk30+buSbPO3lPmISfXT/7T/iDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:58:49.642246Z"},"content_sha256":"f9e5584d959ad29c45f766397a291f504ece29fdd5455d4538096ac931ac987f","schema_version":"1.0","event_id":"sha256:f9e5584d959ad29c45f766397a291f504ece29fdd5455d4538096ac931ac987f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:P3EZOY5WKJWUHM425J5YPTXB4G","target":"graph","payload":{"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"},"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-18T04:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BtkZGLLvHhL4ahS/X42le1oNvUxRFqFyRI4uJAl0dDIrZ9rDCaq5m1Cbg5vhZcPv2r8v0zxpUh4x9e+/IyCpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:58:49.642621Z"},"content_sha256":"a7f10570ff6a0e24f664fddbbc447b89cd0b96e8eb8fd74a2840749536e5cd22","schema_version":"1.0","event_id":"sha256:a7f10570ff6a0e24f664fddbbc447b89cd0b96e8eb8fd74a2840749536e5cd22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G/bundle.json","state_url":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P3EZOY5WKJWUHM425J5YPTXB4G/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-05T11:58:49Z","links":{"resolver":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G","bundle":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G/bundle.json","state":"https://pith.science/pith/P3EZOY5WKJWUHM425J5YPTXB4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P3EZOY5WKJWUHM425J5YPTXB4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:P3EZOY5WKJWUHM425J5YPTXB4G","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":"acc13b7ee520874135350a0e04505b82b01cc370e3699811198d1ce59676693c","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-03T09:03:44Z","title_canon_sha256":"51deea2e603e8bfa819224e4ae3b3301adb56c12027baebde97648865996459c"},"schema_version":"1.0","source":{"id":"1107.0439","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0439","created_at":"2026-05-18T04:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0439v1","created_at":"2026-05-18T04:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0439","created_at":"2026-05-18T04:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"P3EZOY5WKJWU","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"P3EZOY5WKJWUHM42","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"P3EZOY5W","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:a7f10570ff6a0e24f664fddbbc447b89cd0b96e8eb8fd74a2840749536e5cd22","target":"graph","created_at":"2026-05-18T04:18:53Z","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":"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","authors_text":"H. Reiju Mihara, Masahiro Kumabe","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-03T09:03:44Z","title":"The Nakamura numbers for computable simple games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0439","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:f9e5584d959ad29c45f766397a291f504ece29fdd5455d4538096ac931ac987f","target":"record","created_at":"2026-05-18T04:18:53Z","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":"acc13b7ee520874135350a0e04505b82b01cc370e3699811198d1ce59676693c","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-03T09:03:44Z","title_canon_sha256":"51deea2e603e8bfa819224e4ae3b3301adb56c12027baebde97648865996459c"},"schema_version":"1.0","source":{"id":"1107.0439","kind":"arxiv","version":1}},"canonical_sha256":"7ec99763b6526d43b39aea7b87cee1e1b26f48c5c644a68932298d37c7756cd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ec99763b6526d43b39aea7b87cee1e1b26f48c5c644a68932298d37c7756cd7","first_computed_at":"2026-05-18T04:18:53.971404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:53.971404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M2RWCVx947iQrcLeSGzBaeRt3UVTMXyOOyllEAGBHm98ttZZmx10l3E3uYLuyWmi4XurEAwOb3i3pAJV4XxvDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:53.971834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0439","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9e5584d959ad29c45f766397a291f504ece29fdd5455d4538096ac931ac987f","sha256:a7f10570ff6a0e24f664fddbbc447b89cd0b96e8eb8fd74a2840749536e5cd22"],"state_sha256":"e195743392f67426b07c8e1bdef645ebfeb3e6fdf52c2553757eb6ecc99fe475"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7INL0CSzZ49sDfMpEgHFq2b4qu9QD8S5QdUw8YAP6FJL9z2LwngIdj+fUmgKmzbkjBHEbWuuhSHKwwZok15kBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:58:49.644685Z","bundle_sha256":"b10993a95b74890dfc4c4bddaa5b7a357bb991a02acdf55ec7c6a8ff5f072eb5"}}