{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QKBCYH7QLJR2Y5OZ5VYERYML2S","short_pith_number":"pith:QKBCYH7Q","schema_version":"1.0","canonical_sha256":"82822c1ff05a63ac75d9ed7048e18bd4901e0f8fb20cd25f4c174641a1bba3dc","source":{"kind":"arxiv","id":"1304.7244","version":1},"attestation_state":"computed","paper":{"title":"Relation-algebraic and Tool-supported Control of Condorcet Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Henning Schnoor, Rudolf Berghammer","submitted_at":"2013-03-28T11:17:46Z","abstract_excerpt":"We present a relation-algebraic model of Condorcet voting and, based on it, relation-algebraic solutions of the constructive control problem via the removal of voters.\n  We consider two winning conditions, viz. to be a Condorcet winner and to be in the (Gilles resp. upward) uncovered set. For the first condition the control problem is known to be NP-hard; for the second condition the NP-hardness of the control problem is shown in the paper. All relation-algebraic specifications we will develop in the paper immediately can be translated into the programming language of the BDD-based computer sy"},"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":"1304.7244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-03-28T11:17:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1a106a4bd4db988f8dbc8d8ef11332a12ac3bb174996794ab649590802553581","abstract_canon_sha256":"e6b04d889beec3af299da687f4891ccee847a368f4c28507d0a0fbbf3848a5bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:02.205983Z","signature_b64":"9SyMTfE6w79vSTzAV0wbPbG46RrVFrcmrJPovLJ1AaMhcvR+rGm3MaZMtORiruM6nB7tClZr4E/n67z1rX9NCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82822c1ff05a63ac75d9ed7048e18bd4901e0f8fb20cd25f4c174641a1bba3dc","last_reissued_at":"2026-05-18T03:27:02.205574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:02.205574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relation-algebraic and Tool-supported Control of Condorcet Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Henning Schnoor, Rudolf Berghammer","submitted_at":"2013-03-28T11:17:46Z","abstract_excerpt":"We present a relation-algebraic model of Condorcet voting and, based on it, relation-algebraic solutions of the constructive control problem via the removal of voters.\n  We consider two winning conditions, viz. to be a Condorcet winner and to be in the (Gilles resp. upward) uncovered set. For the first condition the control problem is known to be NP-hard; for the second condition the NP-hardness of the control problem is shown in the paper. All relation-algebraic specifications we will develop in the paper immediately can be translated into the programming language of the BDD-based computer sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7244","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.7244","created_at":"2026-05-18T03:27:02.205638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7244v1","created_at":"2026-05-18T03:27:02.205638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7244","created_at":"2026-05-18T03:27:02.205638+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKBCYH7QLJR2","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKBCYH7QLJR2Y5OZ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKBCYH7Q","created_at":"2026-05-18T12:27:57.521954+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/QKBCYH7QLJR2Y5OZ5VYERYML2S","json":"https://pith.science/pith/QKBCYH7QLJR2Y5OZ5VYERYML2S.json","graph_json":"https://pith.science/api/pith-number/QKBCYH7QLJR2Y5OZ5VYERYML2S/graph.json","events_json":"https://pith.science/api/pith-number/QKBCYH7QLJR2Y5OZ5VYERYML2S/events.json","paper":"https://pith.science/paper/QKBCYH7Q"},"agent_actions":{"view_html":"https://pith.science/pith/QKBCYH7QLJR2Y5OZ5VYERYML2S","download_json":"https://pith.science/pith/QKBCYH7QLJR2Y5OZ5VYERYML2S.json","view_paper":"https://pith.science/paper/QKBCYH7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7244&json=true","fetch_graph":"https://pith.science/api/pith-number/QKBCYH7QLJR2Y5OZ5VYERYML2S/graph.json","fetch_events":"https://pith.science/api/pith-number/QKBCYH7QLJR2Y5OZ5VYERYML2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKBCYH7QLJR2Y5OZ5VYERYML2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKBCYH7QLJR2Y5OZ5VYERYML2S/action/storage_attestation","attest_author":"https://pith.science/pith/QKBCYH7QLJR2Y5OZ5VYERYML2S/action/author_attestation","sign_citation":"https://pith.science/pith/QKBCYH7QLJR2Y5OZ5VYERYML2S/action/citation_signature","submit_replication":"https://pith.science/pith/QKBCYH7QLJR2Y5OZ5VYERYML2S/action/replication_record"}},"created_at":"2026-05-18T03:27:02.205638+00:00","updated_at":"2026-05-18T03:27:02.205638+00:00"}