{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BHYOWNMUBRBGATQSDVW2RRXIW3","short_pith_number":"pith:BHYOWNMU","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"},"canonical_sha256":"09f0eb35940c42604e121d6da8c6e8b6f9029a3c89ad32f3f98066b0d8b377d4","source":{"kind":"arxiv","id":"1602.01581","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01581","created_at":"2026-05-18T01:11:04Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01581v3","created_at":"2026-05-18T01:11:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01581","created_at":"2026-05-18T01:11:04Z"},{"alias_kind":"pith_short_12","alias_value":"BHYOWNMUBRBG","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BHYOWNMUBRBGATQS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BHYOWNMU","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BHYOWNMUBRBGATQSDVW2RRXIW3","target":"record","payload":{"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"},"canonical_sha256":"09f0eb35940c42604e121d6da8c6e8b6f9029a3c89ad32f3f98066b0d8b377d4","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"},"source_kind":"arxiv","source_id":"1602.01581","source_version":3,"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:11:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OFrOeeOAHc2bQ9rXwqlVbCcwI8pB49CbLNTaS9Bv6pPj3xNTFUxL19dZNgbjrNt2JgQCeiUi1fi1OjK/RO30Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:16:23.602824Z"},"content_sha256":"5c593431fdb8cb8664002ace42caae4f47c65204995ed85e2970af8b20dc95a2","schema_version":"1.0","event_id":"sha256:5c593431fdb8cb8664002ace42caae4f47c65204995ed85e2970af8b20dc95a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BHYOWNMUBRBGATQSDVW2RRXIW3","target":"graph","payload":{"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"},"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:11:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ClEJXp7gXG3p7EEgK0wukeBmISw3BlqziZGMQ+DrWuD6e4GhzTrw3IUsc0LsPq388iM3KWcouu1y2UhSPXIOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:16:23.603210Z"},"content_sha256":"4f0b028ab41b9ed28cf6d3c5b63ea1054062c8cfe55e67f651f7710462e157cc","schema_version":"1.0","event_id":"sha256:4f0b028ab41b9ed28cf6d3c5b63ea1054062c8cfe55e67f651f7710462e157cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3/bundle.json","state_url":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHYOWNMUBRBGATQSDVW2RRXIW3/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-26T03:16:23Z","links":{"resolver":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3","bundle":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3/bundle.json","state":"https://pith.science/pith/BHYOWNMUBRBGATQSDVW2RRXIW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHYOWNMUBRBGATQSDVW2RRXIW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BHYOWNMUBRBGATQSDVW2RRXIW3","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":"a0798b4c5b74278c11d64b12cfd0a84680b0a939cc1ad5d78f659100c6788047","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-02-04T08:08:49Z","title_canon_sha256":"c56dbb8489b9ac1cf12ec40aa6a44522524ce4fa849bbcf5421065ebebc05851"},"schema_version":"1.0","source":{"id":"1602.01581","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01581","created_at":"2026-05-18T01:11:04Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01581v3","created_at":"2026-05-18T01:11:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01581","created_at":"2026-05-18T01:11:04Z"},{"alias_kind":"pith_short_12","alias_value":"BHYOWNMUBRBG","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BHYOWNMUBRBGATQS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BHYOWNMU","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:4f0b028ab41b9ed28cf6d3c5b63ea1054062c8cfe55e67f651f7710462e157cc","target":"graph","created_at":"2026-05-18T01:11:04Z","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":"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","authors_text":"Martin Olsen, Sascha Kurz, Xavier Molinero","cross_cats":["cs.IT","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-02-04T08:08:49Z","title":"On the Construction of High Dimensional Simple Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01581","kind":"arxiv","version":3},"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:5c593431fdb8cb8664002ace42caae4f47c65204995ed85e2970af8b20dc95a2","target":"record","created_at":"2026-05-18T01:11:04Z","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":"a0798b4c5b74278c11d64b12cfd0a84680b0a939cc1ad5d78f659100c6788047","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-02-04T08:08:49Z","title_canon_sha256":"c56dbb8489b9ac1cf12ec40aa6a44522524ce4fa849bbcf5421065ebebc05851"},"schema_version":"1.0","source":{"id":"1602.01581","kind":"arxiv","version":3}},"canonical_sha256":"09f0eb35940c42604e121d6da8c6e8b6f9029a3c89ad32f3f98066b0d8b377d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09f0eb35940c42604e121d6da8c6e8b6f9029a3c89ad32f3f98066b0d8b377d4","first_computed_at":"2026-05-18T01:11:04.908596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:04.908596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tmHjp5IrGCtCJKKIPWEN7vhXm2Gdn2yY9rDjGAmx97fuCRx/WenooSg6yuCCYvnENYh1ZRjBXpsNw0dMCijiCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:04.909149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01581","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c593431fdb8cb8664002ace42caae4f47c65204995ed85e2970af8b20dc95a2","sha256:4f0b028ab41b9ed28cf6d3c5b63ea1054062c8cfe55e67f651f7710462e157cc"],"state_sha256":"3015ee4957f60c206bea7e2a488c229e3db459ad284b61ddf7beef61b4889cab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EE7soV/UN/6ysdXNtQNDMngHO8wEWlld9Rib8LK1iwZRzz8ZSR+m2YnuAuUK8kWPRw6SM6sA4g0q1VAsH2AcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:16:23.605753Z","bundle_sha256":"96b4fe13a71ff27b85bfb7756df6e3e2c05c82131a045e15768449dfb5680248"}}