{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QXJQFSQ3YSMTCXB7M4UOJSBM5K","short_pith_number":"pith:QXJQFSQ3","canonical_record":{"source":{"id":"1609.04960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-09-16T09:21:33Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"e9081349f226a833c1b21a9a06508e86e228e769be2e67c58691ee25c8fbc433","abstract_canon_sha256":"3a23e0c33e141024fdfe55a43d55b519dacae9896f11680e3a4c946b5e2ee8e1"},"schema_version":"1.0"},"canonical_sha256":"85d302ca1bc499315c3f6728e4c82cea930071307d545fa3b69c4c19241d19ee","source":{"kind":"arxiv","id":"1609.04960","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04960","created_at":"2026-05-18T01:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04960v1","created_at":"2026-05-18T01:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04960","created_at":"2026-05-18T01:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"QXJQFSQ3YSMT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QXJQFSQ3YSMTCXB7","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QXJQFSQ3","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QXJQFSQ3YSMTCXB7M4UOJSBM5K","target":"record","payload":{"canonical_record":{"source":{"id":"1609.04960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-09-16T09:21:33Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"e9081349f226a833c1b21a9a06508e86e228e769be2e67c58691ee25c8fbc433","abstract_canon_sha256":"3a23e0c33e141024fdfe55a43d55b519dacae9896f11680e3a4c946b5e2ee8e1"},"schema_version":"1.0"},"canonical_sha256":"85d302ca1bc499315c3f6728e4c82cea930071307d545fa3b69c4c19241d19ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:31.961267Z","signature_b64":"ZkXTmBbrc6tkGvV3uFwd6KfwaCZRDOPpLjy2TX35pve6N0J88JZLxRtcrn9A84YxWFgAzCQ6/vXsBM+Gp/rbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d302ca1bc499315c3f6728e4c82cea930071307d545fa3b69c4c19241d19ee","last_reissued_at":"2026-05-18T01:04:31.960684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:31.960684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.04960","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-18T01:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anxegI1psu1sHvcoZGyl0/c1rB/+8wnN84tXrTckGLX4kF/u4Ine+pClRTDvd5VrvIswyotplnC13tTHzL+uDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:48:58.972742Z"},"content_sha256":"cc6f14de0197a4b7354e60269faee14f267786367b37d1f0ae1510e27a6b0405","schema_version":"1.0","event_id":"sha256:cc6f14de0197a4b7354e60269faee14f267786367b37d1f0ae1510e27a6b0405"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QXJQFSQ3YSMTCXB7M4UOJSBM5K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Covering Codes and Upper Bounds for the Dimension of Simple Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Martin Olsen","submitted_at":"2016-09-16T09:21:33Z","abstract_excerpt":"Consider a situation with $n$ agents or players where some of the players form a coalition with a certain collective objective. Simple games are used to model systems that can decide whether coalitions are successful (winning) or not (losing). A simple game can be viewed as a monotone boolean function. The dimension of a simple game is the smallest positive integer $d$ such that the simple game can be expressed as the intersection of $d$ threshold functions where each threshold function uses a threshold and $n$ weights. Taylor and Zwicker have shown that $d$ is bounded from above by the number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04960","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-18T01:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5gGOYJlNQ0tXMUWxGXRpRvrB0xGVr/yyh/ygzpwfeDRN2YV7aTjL3qjtNEkc6UsRHWe6GLwYFA7N7iiUy7PjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:48:58.973331Z"},"content_sha256":"241dabc329a209876ff3b0ddfb4f5cc13845ed529a2cbe6d42f2bb0245e14399","schema_version":"1.0","event_id":"sha256:241dabc329a209876ff3b0ddfb4f5cc13845ed529a2cbe6d42f2bb0245e14399"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXJQFSQ3YSMTCXB7M4UOJSBM5K/bundle.json","state_url":"https://pith.science/pith/QXJQFSQ3YSMTCXB7M4UOJSBM5K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXJQFSQ3YSMTCXB7M4UOJSBM5K/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-07T09:48:58Z","links":{"resolver":"https://pith.science/pith/QXJQFSQ3YSMTCXB7M4UOJSBM5K","bundle":"https://pith.science/pith/QXJQFSQ3YSMTCXB7M4UOJSBM5K/bundle.json","state":"https://pith.science/pith/QXJQFSQ3YSMTCXB7M4UOJSBM5K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXJQFSQ3YSMTCXB7M4UOJSBM5K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QXJQFSQ3YSMTCXB7M4UOJSBM5K","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":"3a23e0c33e141024fdfe55a43d55b519dacae9896f11680e3a4c946b5e2ee8e1","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-09-16T09:21:33Z","title_canon_sha256":"e9081349f226a833c1b21a9a06508e86e228e769be2e67c58691ee25c8fbc433"},"schema_version":"1.0","source":{"id":"1609.04960","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04960","created_at":"2026-05-18T01:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04960v1","created_at":"2026-05-18T01:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04960","created_at":"2026-05-18T01:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"QXJQFSQ3YSMT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QXJQFSQ3YSMTCXB7","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QXJQFSQ3","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:241dabc329a209876ff3b0ddfb4f5cc13845ed529a2cbe6d42f2bb0245e14399","target":"graph","created_at":"2026-05-18T01:04:31Z","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":"Consider a situation with $n$ agents or players where some of the players form a coalition with a certain collective objective. Simple games are used to model systems that can decide whether coalitions are successful (winning) or not (losing). A simple game can be viewed as a monotone boolean function. The dimension of a simple game is the smallest positive integer $d$ such that the simple game can be expressed as the intersection of $d$ threshold functions where each threshold function uses a threshold and $n$ weights. Taylor and Zwicker have shown that $d$ is bounded from above by the number","authors_text":"Martin Olsen","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-09-16T09:21:33Z","title":"On Covering Codes and Upper Bounds for the Dimension of Simple Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04960","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:cc6f14de0197a4b7354e60269faee14f267786367b37d1f0ae1510e27a6b0405","target":"record","created_at":"2026-05-18T01:04:31Z","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":"3a23e0c33e141024fdfe55a43d55b519dacae9896f11680e3a4c946b5e2ee8e1","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-09-16T09:21:33Z","title_canon_sha256":"e9081349f226a833c1b21a9a06508e86e228e769be2e67c58691ee25c8fbc433"},"schema_version":"1.0","source":{"id":"1609.04960","kind":"arxiv","version":1}},"canonical_sha256":"85d302ca1bc499315c3f6728e4c82cea930071307d545fa3b69c4c19241d19ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85d302ca1bc499315c3f6728e4c82cea930071307d545fa3b69c4c19241d19ee","first_computed_at":"2026-05-18T01:04:31.960684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:31.960684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZkXTmBbrc6tkGvV3uFwd6KfwaCZRDOPpLjy2TX35pve6N0J88JZLxRtcrn9A84YxWFgAzCQ6/vXsBM+Gp/rbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:31.961267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.04960","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc6f14de0197a4b7354e60269faee14f267786367b37d1f0ae1510e27a6b0405","sha256:241dabc329a209876ff3b0ddfb4f5cc13845ed529a2cbe6d42f2bb0245e14399"],"state_sha256":"04aedc0b3af5a5dd6849e682e4e3c3981da26d9c1f1345b5f899ad5d739d9696"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYcZHjZVQIFsKbs5xZBDYgrbY9lXN5iTW2Cu+yaWbB50FkZI9ms1Wcim3z3wZuxW8Yqn0YB0WN3v5WF5YYnzCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:48:58.976585Z","bundle_sha256":"de5450f897e2ab6054250d935d0bdb477e5d5aa7019d9b8bce8c220373abfd8c"}}