{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WBQZOPWB3JQBWMKE575DO7CXAI","short_pith_number":"pith:WBQZOPWB","schema_version":"1.0","canonical_sha256":"b061973ec1da601b3144effa377c570200471b4b16b5d23c11b3dad2440eea1c","source":{"kind":"arxiv","id":"2510.19084","version":3},"attestation_state":"computed","paper":{"title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Elias Koutsoupias, Matan Gilboa, Noam Nisan, Paul W. Goldberg","submitted_at":"2025-10-21T21:22:41Z","abstract_excerpt":"Various practical problems within the class $\\Sigma_{2}^P$ possess an unambiguity property, meaning that yes-instances correspond with a unique witness. The semantic class containing all unambiguous $\\Sigma_{2}^P$ problems is denoted $U\\Sigma_{2}^P$. Examples include the existence of (1) a dominating strategy in a game, (2) a Condorcet winner, (3) a strongly popular partition in hedonic games, and (4) a winner (source) in a tournament. The computational complexity of unambiguous problems is not well understood, leaving many questions unresolved. We address this gap in a broad complexity-theore"},"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":"2510.19084","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-10-21T21:22:41Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"9bf8212cec6ffac86fb7a434eb976f282594dd02744dbfac69ea5201d0aaa2fa","abstract_canon_sha256":"ea76ec9340678a06ea5dcc54f0dab4b89c8fa037a2002b09e61ea8b6a058cc34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:11:59.868153Z","signature_b64":"/XGfYOUw1Tf99r2nS6PvbhxvQmNVdSwrCVSuvd0Jg70JOvTVmOpCwclYXhmXMWU3JhC2edy66oxayGnsGOTWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b061973ec1da601b3144effa377c570200471b4b16b5d23c11b3dad2440eea1c","last_reissued_at":"2026-08-03T01:11:59.866432Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:11:59.866432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Elias Koutsoupias, Matan Gilboa, Noam Nisan, Paul W. Goldberg","submitted_at":"2025-10-21T21:22:41Z","abstract_excerpt":"Various practical problems within the class $\\Sigma_{2}^P$ possess an unambiguity property, meaning that yes-instances correspond with a unique witness. The semantic class containing all unambiguous $\\Sigma_{2}^P$ problems is denoted $U\\Sigma_{2}^P$. Examples include the existence of (1) a dominating strategy in a game, (2) a Condorcet winner, (3) a strongly popular partition in hedonic games, and (4) a winner (source) in a tournament. The computational complexity of unambiguous problems is not well understood, leaving many questions unresolved. We address this gap in a broad complexity-theore"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.19084","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.19084/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2510.19084","created_at":"2026-08-03T01:11:59.867500+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.19084v3","created_at":"2026-08-03T01:11:59.867500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.19084","created_at":"2026-08-03T01:11:59.867500+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBQZOPWB3JQB","created_at":"2026-08-03T01:11:59.867500+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBQZOPWB3JQBWMKE","created_at":"2026-08-03T01:11:59.867500+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBQZOPWB","created_at":"2026-08-03T01:11:59.867500+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/WBQZOPWB3JQBWMKE575DO7CXAI","json":"https://pith.science/pith/WBQZOPWB3JQBWMKE575DO7CXAI.json","graph_json":"https://pith.science/api/pith-number/WBQZOPWB3JQBWMKE575DO7CXAI/graph.json","events_json":"https://pith.science/api/pith-number/WBQZOPWB3JQBWMKE575DO7CXAI/events.json","paper":"https://pith.science/paper/WBQZOPWB"},"agent_actions":{"view_html":"https://pith.science/pith/WBQZOPWB3JQBWMKE575DO7CXAI","download_json":"https://pith.science/pith/WBQZOPWB3JQBWMKE575DO7CXAI.json","view_paper":"https://pith.science/paper/WBQZOPWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.19084&json=true","fetch_graph":"https://pith.science/api/pith-number/WBQZOPWB3JQBWMKE575DO7CXAI/graph.json","fetch_events":"https://pith.science/api/pith-number/WBQZOPWB3JQBWMKE575DO7CXAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBQZOPWB3JQBWMKE575DO7CXAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBQZOPWB3JQBWMKE575DO7CXAI/action/storage_attestation","attest_author":"https://pith.science/pith/WBQZOPWB3JQBWMKE575DO7CXAI/action/author_attestation","sign_citation":"https://pith.science/pith/WBQZOPWB3JQBWMKE575DO7CXAI/action/citation_signature","submit_replication":"https://pith.science/pith/WBQZOPWB3JQBWMKE575DO7CXAI/action/replication_record"}},"created_at":"2026-08-03T01:11:59.867500+00:00","updated_at":"2026-08-03T01:11:59.867500+00:00"}