{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RX2ACNLCEAHAWTD6MAJEMYYC7B","short_pith_number":"pith:RX2ACNLC","schema_version":"1.0","canonical_sha256":"8df4013562200e0b4c7e6012466302f86fdc1d3275f735e37e2f8309d06da331","source":{"kind":"arxiv","id":"1112.2861","version":2},"attestation_state":"computed","paper":{"title":"On $\\alpha$-roughly weighted games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.CO","authors_text":"Josep Freixas, Sascha Kurz","submitted_at":"2011-12-13T11:04:14Z","abstract_excerpt":"Gvozdeva, Hemaspaandra, and Slinko (2011) have introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of (roughly) weighted voting games. Their third class $\\mathcal{C}_\\alpha$ consists of all simple games permitting a weighted representation such that each winning coalition has a weight of at least 1 and each losing coalition a weight of at most $\\alpha$. For a given game the minimal possible value of $\\alpha$ is called its critical threshold value. We continue the work on the critical threshold value, initiated by Gvozdeva et al., a"},"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":"1112.2861","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-13T11:04:14Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"257217a1017b03bf7697e909d25398f7c2fa812df241dc9c4648239b519b3a85","abstract_canon_sha256":"ee9f23ba28f82afeefb983044ce0e508abb78430344789c54b6847849bf28bcd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:36.615739Z","signature_b64":"7DKE/KgCI9SDTOn81AjAQxJW9p54c+XXF2b0OuxUUX5CX7lRkqRV1U88kcXmbz8bEST+9I8d5A33J1T6KvKJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8df4013562200e0b4c7e6012466302f86fdc1d3275f735e37e2f8309d06da331","last_reissued_at":"2026-05-18T03:40:36.614916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:36.614916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $\\alpha$-roughly weighted games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.CO","authors_text":"Josep Freixas, Sascha Kurz","submitted_at":"2011-12-13T11:04:14Z","abstract_excerpt":"Gvozdeva, Hemaspaandra, and Slinko (2011) have introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of (roughly) weighted voting games. Their third class $\\mathcal{C}_\\alpha$ consists of all simple games permitting a weighted representation such that each winning coalition has a weight of at least 1 and each losing coalition a weight of at most $\\alpha$. For a given game the minimal possible value of $\\alpha$ is called its critical threshold value. We continue the work on the critical threshold value, initiated by Gvozdeva et al., a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2861","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.2861","created_at":"2026-05-18T03:40:36.615041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.2861v2","created_at":"2026-05-18T03:40:36.615041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2861","created_at":"2026-05-18T03:40:36.615041+00:00"},{"alias_kind":"pith_short_12","alias_value":"RX2ACNLCEAHA","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RX2ACNLCEAHAWTD6","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RX2ACNLC","created_at":"2026-05-18T12:26:41.206345+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/RX2ACNLCEAHAWTD6MAJEMYYC7B","json":"https://pith.science/pith/RX2ACNLCEAHAWTD6MAJEMYYC7B.json","graph_json":"https://pith.science/api/pith-number/RX2ACNLCEAHAWTD6MAJEMYYC7B/graph.json","events_json":"https://pith.science/api/pith-number/RX2ACNLCEAHAWTD6MAJEMYYC7B/events.json","paper":"https://pith.science/paper/RX2ACNLC"},"agent_actions":{"view_html":"https://pith.science/pith/RX2ACNLCEAHAWTD6MAJEMYYC7B","download_json":"https://pith.science/pith/RX2ACNLCEAHAWTD6MAJEMYYC7B.json","view_paper":"https://pith.science/paper/RX2ACNLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.2861&json=true","fetch_graph":"https://pith.science/api/pith-number/RX2ACNLCEAHAWTD6MAJEMYYC7B/graph.json","fetch_events":"https://pith.science/api/pith-number/RX2ACNLCEAHAWTD6MAJEMYYC7B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RX2ACNLCEAHAWTD6MAJEMYYC7B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RX2ACNLCEAHAWTD6MAJEMYYC7B/action/storage_attestation","attest_author":"https://pith.science/pith/RX2ACNLCEAHAWTD6MAJEMYYC7B/action/author_attestation","sign_citation":"https://pith.science/pith/RX2ACNLCEAHAWTD6MAJEMYYC7B/action/citation_signature","submit_replication":"https://pith.science/pith/RX2ACNLCEAHAWTD6MAJEMYYC7B/action/replication_record"}},"created_at":"2026-05-18T03:40:36.615041+00:00","updated_at":"2026-05-18T03:40:36.615041+00:00"}