{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2OPSSRQQBTXOUW3UXPHS3FDRGW","short_pith_number":"pith:2OPSSRQQ","canonical_record":{"source":{"id":"1303.7122","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-03-28T13:51:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"084e88a0ce567880aad714dabcf6457564ca2cd6bcaca007d2472f7a89fc0afe","abstract_canon_sha256":"718b6e1d4fd369e8bc019ed1f010fede09179ba414993e5b16d692a3d5448462"},"schema_version":"1.0"},"canonical_sha256":"d39f2946100ceeea5b74bbcf2d9471359eed26c4688c38695c207728559500eb","source":{"kind":"arxiv","id":"1303.7122","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7122","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7122v2","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7122","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"pith_short_12","alias_value":"2OPSSRQQBTXO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2OPSSRQQBTXOUW3U","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2OPSSRQQ","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2OPSSRQQBTXOUW3UXPHS3FDRGW","target":"record","payload":{"canonical_record":{"source":{"id":"1303.7122","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-03-28T13:51:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"084e88a0ce567880aad714dabcf6457564ca2cd6bcaca007d2472f7a89fc0afe","abstract_canon_sha256":"718b6e1d4fd369e8bc019ed1f010fede09179ba414993e5b16d692a3d5448462"},"schema_version":"1.0"},"canonical_sha256":"d39f2946100ceeea5b74bbcf2d9471359eed26c4688c38695c207728559500eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:01.253015Z","signature_b64":"daZogRvuTCHMwppjlreO8rx6kkJnY/GiH8iGh8qAlv/Er9zx1886bGCgCQpQYGo3EQemZ7aVz8t82mlG/ftDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d39f2946100ceeea5b74bbcf2d9471359eed26c4688c38695c207728559500eb","last_reissued_at":"2026-05-18T03:19:01.252238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:01.252238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.7122","source_version":2,"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-18T03:19:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3l7k87FRVejCoszyIz/B94CbfD3nJ4fxU6PYnSX3Sw1t5ImzJJw6P71eE0dN0FoTnrFM/4YMkj4orXlpqtcRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:35:58.391004Z"},"content_sha256":"d0291c8402af1f365e2e8e5a4760c440ef630e06d062b17fd05fd88ff16ebbdd","schema_version":"1.0","event_id":"sha256:d0291c8402af1f365e2e8e5a4760c440ef630e06d062b17fd05fd88ff16ebbdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2OPSSRQQBTXOUW3UXPHS3FDRGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of the Decisive Problem in Simple, Regular and Weighted Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Andreas Polym\\'eris, Fabi\\'an Riquelme","submitted_at":"2013-03-28T13:51:25Z","abstract_excerpt":"We study the computational complexity of an important property of simple, regular and weighted games, which is decisiveness. We show that this concept can naturally be represented in the context of hypergraph theory, and that decisiveness can be decided for simple games in quasi-polynomial time, and for regular and weighted games in polynomial time. The strongness condition poses the main difficulties, while properness reduces the complexity of the problem, especially if it is amplified by regularity. On the other hand, regularity also allows to specify the problem instances much more economic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7122","kind":"arxiv","version":2},"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-18T03:19:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cufCGhdctOv/6J/uoMhQI+LbLNuGguAU6blTaESfsw+Q3tP3a7zrXRWCGK7HsTFI5IMHKLufkfHCE2pgURsPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:35:58.391712Z"},"content_sha256":"796b105eb47d66ed944d7ae488df2694a1223b1eb55401f150c172b35ee8a62f","schema_version":"1.0","event_id":"sha256:796b105eb47d66ed944d7ae488df2694a1223b1eb55401f150c172b35ee8a62f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2OPSSRQQBTXOUW3UXPHS3FDRGW/bundle.json","state_url":"https://pith.science/pith/2OPSSRQQBTXOUW3UXPHS3FDRGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2OPSSRQQBTXOUW3UXPHS3FDRGW/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-05-27T21:35:58Z","links":{"resolver":"https://pith.science/pith/2OPSSRQQBTXOUW3UXPHS3FDRGW","bundle":"https://pith.science/pith/2OPSSRQQBTXOUW3UXPHS3FDRGW/bundle.json","state":"https://pith.science/pith/2OPSSRQQBTXOUW3UXPHS3FDRGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2OPSSRQQBTXOUW3UXPHS3FDRGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2OPSSRQQBTXOUW3UXPHS3FDRGW","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":"718b6e1d4fd369e8bc019ed1f010fede09179ba414993e5b16d692a3d5448462","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-03-28T13:51:25Z","title_canon_sha256":"084e88a0ce567880aad714dabcf6457564ca2cd6bcaca007d2472f7a89fc0afe"},"schema_version":"1.0","source":{"id":"1303.7122","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7122","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7122v2","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7122","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"pith_short_12","alias_value":"2OPSSRQQBTXO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2OPSSRQQBTXOUW3U","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2OPSSRQQ","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:796b105eb47d66ed944d7ae488df2694a1223b1eb55401f150c172b35ee8a62f","target":"graph","created_at":"2026-05-18T03:19:01Z","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":"We study the computational complexity of an important property of simple, regular and weighted games, which is decisiveness. We show that this concept can naturally be represented in the context of hypergraph theory, and that decisiveness can be decided for simple games in quasi-polynomial time, and for regular and weighted games in polynomial time. The strongness condition poses the main difficulties, while properness reduces the complexity of the problem, especially if it is amplified by regularity. On the other hand, regularity also allows to specify the problem instances much more economic","authors_text":"Andreas Polym\\'eris, Fabi\\'an Riquelme","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-03-28T13:51:25Z","title":"On the Complexity of the Decisive Problem in Simple, Regular and Weighted Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7122","kind":"arxiv","version":2},"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:d0291c8402af1f365e2e8e5a4760c440ef630e06d062b17fd05fd88ff16ebbdd","target":"record","created_at":"2026-05-18T03:19:01Z","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":"718b6e1d4fd369e8bc019ed1f010fede09179ba414993e5b16d692a3d5448462","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-03-28T13:51:25Z","title_canon_sha256":"084e88a0ce567880aad714dabcf6457564ca2cd6bcaca007d2472f7a89fc0afe"},"schema_version":"1.0","source":{"id":"1303.7122","kind":"arxiv","version":2}},"canonical_sha256":"d39f2946100ceeea5b74bbcf2d9471359eed26c4688c38695c207728559500eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d39f2946100ceeea5b74bbcf2d9471359eed26c4688c38695c207728559500eb","first_computed_at":"2026-05-18T03:19:01.252238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:01.252238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"daZogRvuTCHMwppjlreO8rx6kkJnY/GiH8iGh8qAlv/Er9zx1886bGCgCQpQYGo3EQemZ7aVz8t82mlG/ftDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:01.253015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.7122","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0291c8402af1f365e2e8e5a4760c440ef630e06d062b17fd05fd88ff16ebbdd","sha256:796b105eb47d66ed944d7ae488df2694a1223b1eb55401f150c172b35ee8a62f"],"state_sha256":"53d7a6b03695160c3eff5bc5ac0c142eebce33196b530aec85193427aad6e8bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDKx0NZM4nMkZ9qr4v4Cp/Xw7tfBmdBI4ZTnbWJRmq3fmCx26YBlvUEN4sS/DeC3+aJ845fHfot/Odt0fsl8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:35:58.395288Z","bundle_sha256":"27fdd690bad42a8eb5329e721d5ab27b32b5596aa1ddba453e6915a7e5c8272b"}}