{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B5UYRNXQX7AVJTAQ54SLCDTKAE","short_pith_number":"pith:B5UYRNXQ","canonical_record":{"source":{"id":"1704.06304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-20T19:04:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3cf20dfd723d990a37010ff3034acc02268088d604f180d6d5b26d66bace9342","abstract_canon_sha256":"e81c641e499e79bc06e14df9da24ec14892cf2b8a9e19d21bf0b00a471e744a1"},"schema_version":"1.0"},"canonical_sha256":"0f6988b6f0bfc154cc10ef24b10e6a01208d6f075acdc103dc08cc23e11230f2","source":{"kind":"arxiv","id":"1704.06304","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06304","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06304v1","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06304","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"pith_short_12","alias_value":"B5UYRNXQX7AV","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B5UYRNXQX7AVJTAQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B5UYRNXQ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B5UYRNXQX7AVJTAQ54SLCDTKAE","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-20T19:04:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3cf20dfd723d990a37010ff3034acc02268088d604f180d6d5b26d66bace9342","abstract_canon_sha256":"e81c641e499e79bc06e14df9da24ec14892cf2b8a9e19d21bf0b00a471e744a1"},"schema_version":"1.0"},"canonical_sha256":"0f6988b6f0bfc154cc10ef24b10e6a01208d6f075acdc103dc08cc23e11230f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:00.049542Z","signature_b64":"OvuNDrbb2D2I6Ka75fpx6tt8zm4Wb2ByrpYZvG4NQUxXCXe4ABA6RSZR9644LwztLozhK77LLUYunabUOcFzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f6988b6f0bfc154cc10ef24b10e6a01208d6f075acdc103dc08cc23e11230f2","last_reissued_at":"2026-05-18T00:46:00.049123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:00.049123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06304","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-18T00:46:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuhX8CQeqkhSdCJv3GPBafy7bPglnOi2qfkOSLn59GrtuxdZek6skMgSzPj/oIctBW09Dq3o5I7i3Ot2HNhvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:18:51.186801Z"},"content_sha256":"4d3f5949013e08136e5a9e3058da1461c559f489122de960f172191334898638","schema_version":"1.0","event_id":"sha256:4d3f5949013e08136e5a9e3058da1461c559f489122de960f172191334898638"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B5UYRNXQX7AVJTAQ54SLCDTKAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.GT","authors_text":"Christian Geist, Dominik Peters, Felix Brandt, Georg Bachmeier, Hans Georg Seedig, Keyvan Kardel, Paul Harrenstein","submitted_at":"2017-04-20T19:04:28Z","abstract_excerpt":"Many hardness results in computational social choice make use of the fact that every directed graph may be induced as the pairwise majority relation of some preference profile. However, this fact requires a number of voters that is almost linear in the number of alternatives. It is therefore unclear whether these results remain intact when the number of voters is bounded, as is, for example, typically the case in search engine aggregation settings. In this paper, we provide a systematic study of majority digraphs for a constant number of voters resulting in analytical, experimental, and comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06304","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-18T00:46:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fAbXgoPYJ8SgKIaual+fj1FATc8k3L0LOVsqG9bOikfCuKe88IiaoOTYIGoTYWNoBr289U9YI+Xt6u1d3nDRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:18:51.187155Z"},"content_sha256":"275051d24cf9321e9f3d998bb6dbe1be65932ad28ada84dcc29085c03adc29f6","schema_version":"1.0","event_id":"sha256:275051d24cf9321e9f3d998bb6dbe1be65932ad28ada84dcc29085c03adc29f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5UYRNXQX7AVJTAQ54SLCDTKAE/bundle.json","state_url":"https://pith.science/pith/B5UYRNXQX7AVJTAQ54SLCDTKAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5UYRNXQX7AVJTAQ54SLCDTKAE/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-27T22:18:51Z","links":{"resolver":"https://pith.science/pith/B5UYRNXQX7AVJTAQ54SLCDTKAE","bundle":"https://pith.science/pith/B5UYRNXQX7AVJTAQ54SLCDTKAE/bundle.json","state":"https://pith.science/pith/B5UYRNXQX7AVJTAQ54SLCDTKAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5UYRNXQX7AVJTAQ54SLCDTKAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B5UYRNXQX7AVJTAQ54SLCDTKAE","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":"e81c641e499e79bc06e14df9da24ec14892cf2b8a9e19d21bf0b00a471e744a1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-20T19:04:28Z","title_canon_sha256":"3cf20dfd723d990a37010ff3034acc02268088d604f180d6d5b26d66bace9342"},"schema_version":"1.0","source":{"id":"1704.06304","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06304","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06304v1","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06304","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"pith_short_12","alias_value":"B5UYRNXQX7AV","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B5UYRNXQX7AVJTAQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B5UYRNXQ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:275051d24cf9321e9f3d998bb6dbe1be65932ad28ada84dcc29085c03adc29f6","target":"graph","created_at":"2026-05-18T00:46:00Z","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":"Many hardness results in computational social choice make use of the fact that every directed graph may be induced as the pairwise majority relation of some preference profile. However, this fact requires a number of voters that is almost linear in the number of alternatives. It is therefore unclear whether these results remain intact when the number of voters is bounded, as is, for example, typically the case in search engine aggregation settings. In this paper, we provide a systematic study of majority digraphs for a constant number of voters resulting in analytical, experimental, and comple","authors_text":"Christian Geist, Dominik Peters, Felix Brandt, Georg Bachmeier, Hans Georg Seedig, Keyvan Kardel, Paul Harrenstein","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-20T19:04:28Z","title":"k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06304","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:4d3f5949013e08136e5a9e3058da1461c559f489122de960f172191334898638","target":"record","created_at":"2026-05-18T00:46:00Z","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":"e81c641e499e79bc06e14df9da24ec14892cf2b8a9e19d21bf0b00a471e744a1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-20T19:04:28Z","title_canon_sha256":"3cf20dfd723d990a37010ff3034acc02268088d604f180d6d5b26d66bace9342"},"schema_version":"1.0","source":{"id":"1704.06304","kind":"arxiv","version":1}},"canonical_sha256":"0f6988b6f0bfc154cc10ef24b10e6a01208d6f075acdc103dc08cc23e11230f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f6988b6f0bfc154cc10ef24b10e6a01208d6f075acdc103dc08cc23e11230f2","first_computed_at":"2026-05-18T00:46:00.049123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:00.049123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OvuNDrbb2D2I6Ka75fpx6tt8zm4Wb2ByrpYZvG4NQUxXCXe4ABA6RSZR9644LwztLozhK77LLUYunabUOcFzAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:00.049542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06304","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d3f5949013e08136e5a9e3058da1461c559f489122de960f172191334898638","sha256:275051d24cf9321e9f3d998bb6dbe1be65932ad28ada84dcc29085c03adc29f6"],"state_sha256":"a34c858426211ae2d27c2604a9cce35fe13a3ee3db0c9bbbe73a5e94eccd2eb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TzRBjicYiU5TGzuHj4LRVkDXZoVigjiHL3GGkotJG8pohd3uiBnvbtp8ECaKTS4o1HM2JqVC2WjV1mVGLaj2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:18:51.189250Z","bundle_sha256":"a11670e2ea0098abe2fc4ffdb67e1deed1d592990ca24e34395cd7e0c74bc892"}}