{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DAWEILWET76UHIB2HC54AYJWQR","short_pith_number":"pith:DAWEILWE","schema_version":"1.0","canonical_sha256":"182c442ec49ffd43a03a38bbc061368472f537c25be063c070d950c8766bc9b1","source":{"kind":"arxiv","id":"1310.6997","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Online Manipulation of Sequential Elections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Edith Hemaspaandra, Joerg Rothe, Lane A. Hemaspaandra","submitted_at":"2013-10-23T22:46:39Z","abstract_excerpt":"Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We introduce a framework, in which manipulators can see the past votes but not the future ones, to model online coalitional manipulation of sequential elections, and we show that in this setting manipulation can be extremely complex even for election systems with simple winner problems. Yet we also show that for some of the most important election systems such manipu"},"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":"1310.6997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-23T22:46:39Z","cross_cats_sorted":[],"title_canon_sha256":"aa4f794ada851f28845a036a4379a2b16e510201d48eefe19856d0f7b96a46b7","abstract_canon_sha256":"6e0f94d77c4fe159828bdf535faa59ab1a604026d022d4b2560fdf2ae158a4e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:48.132936Z","signature_b64":"FkrEYgXf/ICx1q5SHqs7Of1yugZMf2ALNbfv+MpNl6m2rMzk4FlSf0QrP0JuSbG6UzMIfxrzGEsaqTpdXDXmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"182c442ec49ffd43a03a38bbc061368472f537c25be063c070d950c8766bc9b1","last_reissued_at":"2026-05-18T03:08:48.132381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:48.132381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Online Manipulation of Sequential Elections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Edith Hemaspaandra, Joerg Rothe, Lane A. Hemaspaandra","submitted_at":"2013-10-23T22:46:39Z","abstract_excerpt":"Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We introduce a framework, in which manipulators can see the past votes but not the future ones, to model online coalitional manipulation of sequential elections, and we show that in this setting manipulation can be extremely complex even for election systems with simple winner problems. Yet we also show that for some of the most important election systems such manipu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6997","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":"1310.6997","created_at":"2026-05-18T03:08:48.132487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6997v1","created_at":"2026-05-18T03:08:48.132487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6997","created_at":"2026-05-18T03:08:48.132487+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAWEILWET76U","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAWEILWET76UHIB2","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAWEILWE","created_at":"2026-05-18T12:27:40.988391+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/DAWEILWET76UHIB2HC54AYJWQR","json":"https://pith.science/pith/DAWEILWET76UHIB2HC54AYJWQR.json","graph_json":"https://pith.science/api/pith-number/DAWEILWET76UHIB2HC54AYJWQR/graph.json","events_json":"https://pith.science/api/pith-number/DAWEILWET76UHIB2HC54AYJWQR/events.json","paper":"https://pith.science/paper/DAWEILWE"},"agent_actions":{"view_html":"https://pith.science/pith/DAWEILWET76UHIB2HC54AYJWQR","download_json":"https://pith.science/pith/DAWEILWET76UHIB2HC54AYJWQR.json","view_paper":"https://pith.science/paper/DAWEILWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6997&json=true","fetch_graph":"https://pith.science/api/pith-number/DAWEILWET76UHIB2HC54AYJWQR/graph.json","fetch_events":"https://pith.science/api/pith-number/DAWEILWET76UHIB2HC54AYJWQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAWEILWET76UHIB2HC54AYJWQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAWEILWET76UHIB2HC54AYJWQR/action/storage_attestation","attest_author":"https://pith.science/pith/DAWEILWET76UHIB2HC54AYJWQR/action/author_attestation","sign_citation":"https://pith.science/pith/DAWEILWET76UHIB2HC54AYJWQR/action/citation_signature","submit_replication":"https://pith.science/pith/DAWEILWET76UHIB2HC54AYJWQR/action/replication_record"}},"created_at":"2026-05-18T03:08:48.132487+00:00","updated_at":"2026-05-18T03:08:48.132487+00:00"}