{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:B7S4OLL5LKJSCXMC2NK2JSHA5U","short_pith_number":"pith:B7S4OLL5","canonical_record":{"source":{"id":"1901.09791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T21:41:39Z","cross_cats_sorted":["cs.CY"],"title_canon_sha256":"9e856f96850db21c35ac61d194ff7d03f48adf58a7f3bcb9ccb65d852c3586e1","abstract_canon_sha256":"84b48d3b4251c38424cccc3d54373dc5144a7e011c7c4d4997d7ecece79a15ca"},"schema_version":"1.0"},"canonical_sha256":"0fe5c72d7d5a93215d82d355a4c8e0ed3dd341bdb8842f7d9d84f43e89241111","source":{"kind":"arxiv","id":"1901.09791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09791","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09791v1","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09791","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"B7S4OLL5LKJS","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B7S4OLL5LKJSCXMC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B7S4OLL5","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:B7S4OLL5LKJSCXMC2NK2JSHA5U","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T21:41:39Z","cross_cats_sorted":["cs.CY"],"title_canon_sha256":"9e856f96850db21c35ac61d194ff7d03f48adf58a7f3bcb9ccb65d852c3586e1","abstract_canon_sha256":"84b48d3b4251c38424cccc3d54373dc5144a7e011c7c4d4997d7ecece79a15ca"},"schema_version":"1.0"},"canonical_sha256":"0fe5c72d7d5a93215d82d355a4c8e0ed3dd341bdb8842f7d9d84f43e89241111","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:23.841600Z","signature_b64":"Rbct6tZJucwoXpKt138odpBSW9QwHeQhI35mJRrltHrXn72kEOrwhRAdbZ8Wz9yOKn2Mr2M86ON1oIiyihQLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fe5c72d7d5a93215d82d355a4c8e0ed3dd341bdb8842f7d9d84f43e89241111","last_reissued_at":"2026-05-17T23:55:23.841102Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:23.841102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09791","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-17T23:55:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KvEMUYLP+5Gpvq2PbmY9AjrNojuCaNiMP28+tZd5jSeOlLgnVHmB6cVLqoLS/rO7iSHVvxfukwC+L3zQI5jTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:26:12.335510Z"},"content_sha256":"c3f4e2dd6e7b55c1d0961ad72d260d308aac9a3953038f93da3baf4cb991c4ef","schema_version":"1.0","event_id":"sha256:c3f4e2dd6e7b55c1d0961ad72d260d308aac9a3953038f93da3baf4cb991c4ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:B7S4OLL5LKJSCXMC2NK2JSHA5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY"],"primary_cat":"cs.AI","authors_text":"Chunheng Jiang, Jun Wang, Lirong Xia, Sujoy Sikdar, Tyler Shepherd, Zhibing Zhao","submitted_at":"2019-01-16T21:41:39Z","abstract_excerpt":"STV and ranked pairs (RP) are two well-studied voting rules for group decision-making. They proceed in multiple rounds, and are affected by how ties are broken in each round. However, the literature is surprisingly vague about how ties should be broken. We propose the first algorithms for computing the set of alternatives that are winners under some tiebreaking mechanism under STV and RP, which is also known as parallel-universes tiebreaking (PUT). Unfortunately, PUT-winners are NP-complete to compute under STV and RP, and standard search algorithms from AI do not apply. We propose multiple DF"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09791","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-17T23:55:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OuERZ4wGMQpNpcOSAC4wJGeyVypRPt/qwODnfLfEkRv9AMm8ldbmy5Bg3Sck6OfXPHsIUqOyFWBARU4SX6lPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:26:12.336229Z"},"content_sha256":"29db9f1e3586189a7040f0971332c03185cf3b00dfae82119f37d28753a2ba35","schema_version":"1.0","event_id":"sha256:29db9f1e3586189a7040f0971332c03185cf3b00dfae82119f37d28753a2ba35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7S4OLL5LKJSCXMC2NK2JSHA5U/bundle.json","state_url":"https://pith.science/pith/B7S4OLL5LKJSCXMC2NK2JSHA5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7S4OLL5LKJSCXMC2NK2JSHA5U/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-26T04:26:12Z","links":{"resolver":"https://pith.science/pith/B7S4OLL5LKJSCXMC2NK2JSHA5U","bundle":"https://pith.science/pith/B7S4OLL5LKJSCXMC2NK2JSHA5U/bundle.json","state":"https://pith.science/pith/B7S4OLL5LKJSCXMC2NK2JSHA5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7S4OLL5LKJSCXMC2NK2JSHA5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:B7S4OLL5LKJSCXMC2NK2JSHA5U","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":"84b48d3b4251c38424cccc3d54373dc5144a7e011c7c4d4997d7ecece79a15ca","cross_cats_sorted":["cs.CY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T21:41:39Z","title_canon_sha256":"9e856f96850db21c35ac61d194ff7d03f48adf58a7f3bcb9ccb65d852c3586e1"},"schema_version":"1.0","source":{"id":"1901.09791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09791","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09791v1","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09791","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"B7S4OLL5LKJS","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B7S4OLL5LKJSCXMC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B7S4OLL5","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:29db9f1e3586189a7040f0971332c03185cf3b00dfae82119f37d28753a2ba35","target":"graph","created_at":"2026-05-17T23:55:23Z","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":"STV and ranked pairs (RP) are two well-studied voting rules for group decision-making. They proceed in multiple rounds, and are affected by how ties are broken in each round. However, the literature is surprisingly vague about how ties should be broken. We propose the first algorithms for computing the set of alternatives that are winners under some tiebreaking mechanism under STV and RP, which is also known as parallel-universes tiebreaking (PUT). Unfortunately, PUT-winners are NP-complete to compute under STV and RP, and standard search algorithms from AI do not apply. We propose multiple DF","authors_text":"Chunheng Jiang, Jun Wang, Lirong Xia, Sujoy Sikdar, Tyler Shepherd, Zhibing Zhao","cross_cats":["cs.CY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T21:41:39Z","title":"Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09791","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:c3f4e2dd6e7b55c1d0961ad72d260d308aac9a3953038f93da3baf4cb991c4ef","target":"record","created_at":"2026-05-17T23:55:23Z","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":"84b48d3b4251c38424cccc3d54373dc5144a7e011c7c4d4997d7ecece79a15ca","cross_cats_sorted":["cs.CY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T21:41:39Z","title_canon_sha256":"9e856f96850db21c35ac61d194ff7d03f48adf58a7f3bcb9ccb65d852c3586e1"},"schema_version":"1.0","source":{"id":"1901.09791","kind":"arxiv","version":1}},"canonical_sha256":"0fe5c72d7d5a93215d82d355a4c8e0ed3dd341bdb8842f7d9d84f43e89241111","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fe5c72d7d5a93215d82d355a4c8e0ed3dd341bdb8842f7d9d84f43e89241111","first_computed_at":"2026-05-17T23:55:23.841102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:23.841102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rbct6tZJucwoXpKt138odpBSW9QwHeQhI35mJRrltHrXn72kEOrwhRAdbZ8Wz9yOKn2Mr2M86ON1oIiyihQLAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:23.841600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3f4e2dd6e7b55c1d0961ad72d260d308aac9a3953038f93da3baf4cb991c4ef","sha256:29db9f1e3586189a7040f0971332c03185cf3b00dfae82119f37d28753a2ba35"],"state_sha256":"47c33e5603891fffb9965f35f13fc80ea53b3db87f0d7b488aa01dfa1a575312"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AETK/h/WDozCwNSK7Fw0zgmeGJuidTdceR8Rg2mlyrJj17JH2Wl1Tc+syb/NHFuu0avHZgudMbjLr29x+KzFDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:26:12.339940Z","bundle_sha256":"e4e2f301a4ac77b3baf8acc05d4df4d5a93d152cdc9dc68fc37e183d14f129ac"}}