{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PGNJ7TUI7JQBGBC4U2EIGSVPZ6","short_pith_number":"pith:PGNJ7TUI","schema_version":"1.0","canonical_sha256":"799a9fce88fa6013045ca688834aafcf82f7f2ab4949c261902d948989ba87ae","source":{"kind":"arxiv","id":"1605.03063","version":1},"attestation_state":"computed","paper":{"title":"This House Proves that Debating is Harder than Soccer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andreas Wiese, Stefan Neumann","submitted_at":"2016-05-10T15:34:42Z","abstract_excerpt":"During the last twenty years, a lot of research was conducted on the sport elimination problem: Given a sports league and its remaining matches, we have to decide whether a given team can still possibly win the competition, i.e., place first in the league at the end. Previously, the computational complexity of this problem was investigated only for games with two participating teams per game. In this paper we consider Debating Tournaments and Debating Leagues in the British Parliamentary format, where four teams are participating in each game. We prove that it is NP-hard to decide whether a gi"},"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":"1605.03063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-10T15:34:42Z","cross_cats_sorted":[],"title_canon_sha256":"80dfcb5f94de835518fda9be4c569e4d437fc4039238cec3beb13ac4fd7d8c2c","abstract_canon_sha256":"8ef890ee4141866d9a9305a7f46b0ad52b5b8455d086e562ba42f5987bccfc3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:07.717657Z","signature_b64":"YWCHq1KGIC+mEAiXFE4HO3A+frUNFCsjDLlF0My2G78+7Vrw2Kr0zDUknajBxoS9D3RLe5aEWxDo0gswB2igBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"799a9fce88fa6013045ca688834aafcf82f7f2ab4949c261902d948989ba87ae","last_reissued_at":"2026-05-18T01:15:07.716863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:07.716863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"This House Proves that Debating is Harder than Soccer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andreas Wiese, Stefan Neumann","submitted_at":"2016-05-10T15:34:42Z","abstract_excerpt":"During the last twenty years, a lot of research was conducted on the sport elimination problem: Given a sports league and its remaining matches, we have to decide whether a given team can still possibly win the competition, i.e., place first in the league at the end. Previously, the computational complexity of this problem was investigated only for games with two participating teams per game. In this paper we consider Debating Tournaments and Debating Leagues in the British Parliamentary format, where four teams are participating in each game. We prove that it is NP-hard to decide whether a gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03063","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":"1605.03063","created_at":"2026-05-18T01:15:07.716999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03063v1","created_at":"2026-05-18T01:15:07.716999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03063","created_at":"2026-05-18T01:15:07.716999+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGNJ7TUI7JQB","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGNJ7TUI7JQBGBC4","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGNJ7TUI","created_at":"2026-05-18T12:30:39.010887+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/PGNJ7TUI7JQBGBC4U2EIGSVPZ6","json":"https://pith.science/pith/PGNJ7TUI7JQBGBC4U2EIGSVPZ6.json","graph_json":"https://pith.science/api/pith-number/PGNJ7TUI7JQBGBC4U2EIGSVPZ6/graph.json","events_json":"https://pith.science/api/pith-number/PGNJ7TUI7JQBGBC4U2EIGSVPZ6/events.json","paper":"https://pith.science/paper/PGNJ7TUI"},"agent_actions":{"view_html":"https://pith.science/pith/PGNJ7TUI7JQBGBC4U2EIGSVPZ6","download_json":"https://pith.science/pith/PGNJ7TUI7JQBGBC4U2EIGSVPZ6.json","view_paper":"https://pith.science/paper/PGNJ7TUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03063&json=true","fetch_graph":"https://pith.science/api/pith-number/PGNJ7TUI7JQBGBC4U2EIGSVPZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/PGNJ7TUI7JQBGBC4U2EIGSVPZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGNJ7TUI7JQBGBC4U2EIGSVPZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGNJ7TUI7JQBGBC4U2EIGSVPZ6/action/storage_attestation","attest_author":"https://pith.science/pith/PGNJ7TUI7JQBGBC4U2EIGSVPZ6/action/author_attestation","sign_citation":"https://pith.science/pith/PGNJ7TUI7JQBGBC4U2EIGSVPZ6/action/citation_signature","submit_replication":"https://pith.science/pith/PGNJ7TUI7JQBGBC4U2EIGSVPZ6/action/replication_record"}},"created_at":"2026-05-18T01:15:07.716999+00:00","updated_at":"2026-05-18T01:15:07.716999+00:00"}