{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CG5OKXFYR2MYFFHB7O3AF2XXFK","short_pith_number":"pith:CG5OKXFY","schema_version":"1.0","canonical_sha256":"11bae55cb88e998294e1fbb602eaf72a834b86fbc7c2806cdd60b6a5f7f17eb7","source":{"kind":"arxiv","id":"2605.21234","version":1},"attestation_state":"computed","paper":{"title":"The Team Order Problem: Maximizing the Probability of Matching Being Large Enough","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ali Pourmiri, Grzegorz Lisowski, Haris Aziz, Jiarui Gan","submitted_at":"2026-05-20T14:24:07Z","abstract_excerpt":"We consider a matching problem, which is meaningful in team competitions, as well as in information theory, recommender systems, and assignment problems. In the competitions which we study, each competitor in a team order plays a match with the corresponding opposing player. The team that wins more matches wins. We consider a problem where the input is the graph of probabilities that a team 1 player can win against the team 2 player, and the output is the optimal ordering of team 1 players given the fixed ordering of team 2. Our central result is a polynomial-time approximation scheme (PTAS) t"},"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":"2605.21234","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-20T14:24:07Z","cross_cats_sorted":[],"title_canon_sha256":"e0d7fc8ea995461c9369f0df6ffe37d61d690482d5b650fbcb12136527ccaa0b","abstract_canon_sha256":"8a68b9f0dae949641e974bbfb520ed18c1cfcbebeb7d0989220a4b92d0da213e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:44.906118Z","signature_b64":"jN1rqvvzfZUenJmE1ASAL8lt5fznkuVEGwJ9JvkvTAwKEZOGcMzuOX8gdSJXoi405zqOf/MuuYWcCVzWMBVwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11bae55cb88e998294e1fbb602eaf72a834b86fbc7c2806cdd60b6a5f7f17eb7","last_reissued_at":"2026-05-21T01:05:44.905521Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:44.905521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Team Order Problem: Maximizing the Probability of Matching Being Large Enough","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ali Pourmiri, Grzegorz Lisowski, Haris Aziz, Jiarui Gan","submitted_at":"2026-05-20T14:24:07Z","abstract_excerpt":"We consider a matching problem, which is meaningful in team competitions, as well as in information theory, recommender systems, and assignment problems. In the competitions which we study, each competitor in a team order plays a match with the corresponding opposing player. The team that wins more matches wins. We consider a problem where the input is the graph of probabilities that a team 1 player can win against the team 2 player, and the output is the optimal ordering of team 1 players given the fixed ordering of team 2. Our central result is a polynomial-time approximation scheme (PTAS) t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21234","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21234/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":"2605.21234","created_at":"2026-05-21T01:05:44.905626+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21234v1","created_at":"2026-05-21T01:05:44.905626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21234","created_at":"2026-05-21T01:05:44.905626+00:00"},{"alias_kind":"pith_short_12","alias_value":"CG5OKXFYR2MY","created_at":"2026-05-21T01:05:44.905626+00:00"},{"alias_kind":"pith_short_16","alias_value":"CG5OKXFYR2MYFFHB","created_at":"2026-05-21T01:05:44.905626+00:00"},{"alias_kind":"pith_short_8","alias_value":"CG5OKXFY","created_at":"2026-05-21T01:05:44.905626+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/CG5OKXFYR2MYFFHB7O3AF2XXFK","json":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK.json","graph_json":"https://pith.science/api/pith-number/CG5OKXFYR2MYFFHB7O3AF2XXFK/graph.json","events_json":"https://pith.science/api/pith-number/CG5OKXFYR2MYFFHB7O3AF2XXFK/events.json","paper":"https://pith.science/paper/CG5OKXFY"},"agent_actions":{"view_html":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK","download_json":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK.json","view_paper":"https://pith.science/paper/CG5OKXFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21234&json=true","fetch_graph":"https://pith.science/api/pith-number/CG5OKXFYR2MYFFHB7O3AF2XXFK/graph.json","fetch_events":"https://pith.science/api/pith-number/CG5OKXFYR2MYFFHB7O3AF2XXFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK/action/storage_attestation","attest_author":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK/action/author_attestation","sign_citation":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK/action/citation_signature","submit_replication":"https://pith.science/pith/CG5OKXFYR2MYFFHB7O3AF2XXFK/action/replication_record"}},"created_at":"2026-05-21T01:05:44.905626+00:00","updated_at":"2026-05-21T01:05:44.905626+00:00"}