{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BHYOWNMUBRBGATQSDVW2RRXIW3","short_pith_number":"pith:BHYOWNMU","schema_version":"1.0","canonical_sha256":"09f0eb35940c42604e121d6da8c6e8b6f9029a3c89ad32f3f98066b0d8b377d4","source":{"kind":"arxiv","id":"1602.01581","version":3},"attestation_state":"computed","paper":{"title":"On the Construction of High Dimensional Simple Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.GT","authors_text":"Martin Olsen, Sascha Kurz, Xavier Molinero","submitted_at":"2016-02-04T08:08:49Z","abstract_excerpt":"Voting is a commonly applied method for the aggregation of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., \"yes\" and \"no\", every voting system can be described by a (monotone) Boolean function $\\chi\\colon\\{0,1\\}^n\\rightarrow \\{0,1\\}$. However, its naive encoding needs $2^n$ bits. The subclass of threshold functions, which is sufficient for homogeneous agents, allows a more succinct representation using $n$ weights and one threshold. For heterogeneous agents, one can represent $\\chi$ as an intersection of $k$ threshold functions. Taylor and Zwicker hav"},"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":"1602.01581","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-02-04T08:08:49Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"c56dbb8489b9ac1cf12ec40aa6a44522524ce4fa849bbcf5421065ebebc05851","abstract_canon_sha256":"a0798b4c5b74278c11d64b12cfd0a84680b0a939cc1ad5d78f659100c6788047"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:04.909149Z","signature_b64":"tmHjp5IrGCtCJKKIPWEN7vhXm2Gdn2yY9rDjGAmx97fuCRx/WenooSg6yuCCYvnENYh1ZRjBXpsNw0dMCijiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09f0eb35940c42604e121d6da8c6e8b6f9029a3c89ad32f3f98066b0d8b377d4","last_reissued_at":"2026-05-18T01:11:04.908596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:04.908596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Construction of High Dimensional Simple Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.GT","authors_text":"Martin Olsen, Sascha Kurz, Xavier Molinero","submitted_at":"2016-02-04T08:08:49Z","abstract_excerpt":"Voting is a commonly applied method for the aggregation of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., \"yes\" and \"no\", every voting system can be described by a (monotone) Boolean function $\\chi\\colon\\{0,1\\}^n\\rightarrow \\{0,1\\}$. However, its naive encoding needs $2^n$ bits. The subclass of threshold functions, which is sufficient for homogeneous agents, allows a more succinct representation using $n$ weights and one threshold. For heterogeneous agents, one can represent $\\chi$ as an intersection of $k$ threshold functions. Taylor and Zwicker hav"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01581","kind":"arxiv","version":3},"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":"1602.01581","created_at":"2026-05-18T01:11:04.908689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01581v3","created_at":"2026-05-18T01:11:04.908689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01581","created_at":"2026-05-18T01:11:04.908689+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHYOWNMUBRBG","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHYOWNMUBRBGATQS","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHYOWNMU","created_at":"2026-05-18T12:30:07.202191+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/BHYOWNMUBRBGATQSDVW2RRXIW3","json":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3.json","graph_json":"https://pith.science/api/pith-number/BHYOWNMUBRBGATQSDVW2RRXIW3/graph.json","events_json":"https://pith.science/api/pith-number/BHYOWNMUBRBGATQSDVW2RRXIW3/events.json","paper":"https://pith.science/paper/BHYOWNMU"},"agent_actions":{"view_html":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3","download_json":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3.json","view_paper":"https://pith.science/paper/BHYOWNMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01581&json=true","fetch_graph":"https://pith.science/api/pith-number/BHYOWNMUBRBGATQSDVW2RRXIW3/graph.json","fetch_events":"https://pith.science/api/pith-number/BHYOWNMUBRBGATQSDVW2RRXIW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3/action/storage_attestation","attest_author":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3/action/author_attestation","sign_citation":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3/action/citation_signature","submit_replication":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3/action/replication_record"}},"created_at":"2026-05-18T01:11:04.908689+00:00","updated_at":"2026-05-18T01:11:04.908689+00:00"}